Based on Weiss Exercise 5.21 - implement this problem as described with the exception of the secondary dictionary. Your program, called SpellChecker.java should take two command line arguments (that is via the args variable in main): (1) the name of a dictionary file (here is a sample: words.txt ), and (2) the name of the file that contains the text you wish to spellcheck. Submit some sample text with your solution. Your prograim should be case insensitive so you can tolower everything Numbers and contractions are valid input, don't strip them out or treat them any differently than a regular word. Only strip leading and trailing punctuation, do not worry about' characters at the end of a possessive plural: just remove them. Note that each of the suggestion rules should be applied independently and in the first rule (add character) you need to try the characters a-z and the you do not need to add numbers. You may use the java HashSet, HashMap, or HashTable to implement this program; but it must use some kind of hash table