Build Java Project

You are required to implement a way to manage a Table/Dictionary, with operations on that ADT specified in the interface Dictionary.java. The Table stores Strings, referenced by SortableStrings (Strings that implement the Sortable interface). Your implementation should internally use a Binary Search Tree (BST). The trees in turn are to be implemented using references. The course cuLearn page provides you a source file [login to view URL] with the main routine that instantiates a dictionary and invokes the methods defined in the interface Dictionary to add and deletes entries, print the tree, search for entries, and to print the depth of the underlying binary tree. The course cuLearn page also provides the interface definition Dictionary.java. You have to provide an implementation of BSTDictionary, which implement this interface. To get you started, the course page also provides source files for the Sortable interface and the SortableString class, as well as the source for a BSTNode. Binary Search Trees are described in the textbook in Section 11.3, starting on page 551 (2nd edition) or page 594 (3rd edition). Note that unlike the discussion in the textbook, the Dictionary interface manages a table where the search key of type K is a separate data item from the entry of type E (with both being stored in a tree node). Also, the key type K is not of type KeyedItem but has to implement/extend the interface Sortable. use netbeans so if you could please make it work in netbeans.