You will be making a binary search tree class. Then you will use it to import a text file and create a word frequency histogram. Your binary search tree class should have the following methods: search-finds and returns the node that matches a search key (if it exists; otherwise return null) insert-inserts a node into the tree delete-deletes a node from the tree print-traverse (inorder) and print each node any methods you need to solve the problem of using a tree to make a word frequency histogram. You should be able to read a file and add a word if it isn't in the tree yet and update a counter associated with it if it is in the tree. This sentence repeats words because a sentence that repeats words makes a good example sentence. a 2 because 1 example 1 good 1 makes 1 repeats 2 sentence 3 that 1 this 1 words 2