This is in Java code

Automated spell checkers are used to analyze documents and locate words that might be misspelled. These programs work by comparing each word in the document to a large dictionary of words. If the word is not found in the dictionary, it is flagged as potentially incorrect. Write a program to perform spell-checking on a text file. To do this, you will need to get a large file of English words in alphabetical order, read this file (use the given dictionary.txt) and store the words in an array (NOT an ArrayList). Next, your program should prompt for a file to analyze (use the given oliver.txt a) and then search every word of "oliver" in the "dictionary" file using your own recursive binary search algorithm. Do not use the binarySearch method in Arrays class!! When reading 'oliver.txt' file, you are required to remove any special characters in the file and consider only the alphabetical words. If a word is not found in the dictionary, print it on the screen as potentially incorrect. In addition, count the number of incorrectly spelled words, total number of recursive steps for all incorrectly spelled words, and output these counters along with the average number of recursive steps per incorrectly spelled words