**IMPLEMENT IN JAVA PLEASE**

Here is the text file:

DEAR MARLIN

THE AARDVARKS AND THE CAMELS WERE MISTAKENLY SHIPPED TO THE AZORES

SORRY ABOUT THAT

SINCERELY JIM

PS ANDS AND BATS AND COWS AND CATS ARE ANIMALS

COWS ARE BIG BUT ANTS ARE SMALL AND BATS AND CATS ARE IN BETWEEN

**IMPLEMENT IN JAVA PLEASE**

The existing code provided is for BinSrchTree, a Binary Search Tree class with type T

the class contains methods print, insert, delete, etc.

In this lab, we will work on an application using BST. Write an application about text hash trees. In the application, declares an array of 11 or 13 BSTS of type String. When a word is to be inserted into one of the BSTs, a hashing function his applied to the word to determine which BST it is to be placed in; for this problem, the following hashing function is adopted: h(str) = (sum of the ASCII codes of the first 3 characters of str) %11 or 13 Words whose hash is 0 will be stored in the BST at h[0], those whose hash is 1 will be stored in the BST at h[1], etc. Inputs the name of the data file. Reads from that file, and for each word, complete the following tasks: a. Searches the appropriate BST for that word b. If it is not found, inserts it into the BST After reading the file, display the text hash trees. For each non-empty BST, display the hash, followed by its words in alphabetical order on the same line. Test with both TestData-11B.txt and Poem.txt. In this lab, we will work on an application using BST. Write an application about text hash trees. In the application, declares an array of 11 or 13 BSTS of type String. When a word is to be inserted into one of the BSTs, a hashing function his applied to the word to determine which BST it is to be placed in; for this problem, the following hashing function is adopted: h(str) = (sum of the ASCII codes of the first 3 characters of str) %11 or 13 Words whose hash is 0 will be stored in the BST at h[0], those whose hash is 1 will be stored in the BST at h[1], etc. Inputs the name of the data file. Reads from that file, and for each word, complete the following tasks: a. Searches the appropriate BST for that word b. If it is not found, inserts it into the BST After reading the file, display the text hash trees. For each non-empty BST, display the hash, followed by its words in alphabetical order on the same line. Test with both TestData-11B.txt and Poem.txt