n this assignment you will implement the second version of yourspell checker. Using the randomized dictionary(random_dictionary.txt) given, read in the dictionary into an arrayof 26 Binary Search Trees (BST) , one for each letter of thealphabet. Thus the first BST would contain only those wordsstarting with letter ‘a’, while the last would contain only thosewords starting with letter ‘z’. Then, when you read in the book(oliver.txt), you examine the first character of each word, andsearch (this method is already implemented in BinarySearchTeeclass) the word in one of the BST. For each word read from thebook, see if it is in
OR
OR