write a program that performs spell checking on input strings

taken from the user. At start, your program should take a txt file as the command$-$line argument:

a file containing the dictionary.

Your program should read the dictionary, and build a Trie$-$based index for it$,$ as we

discussed in the class. Then it will wait input strings from user. For each input string given, it

performs a search for the string on the trie. If it is misspelled, the program should print

$$misspelled$?$ and then suggest three alternatives $($or less than three if there are not enough

prefix matching words$),$ with the longest matching prefixes. Otherwise, it prints $$correct word$.$

Your implementation should work in constant time $($or linear time with respect to

number of characters of the string given as input$).$

INPUT FORMAT OUTPUT FORMAT

Your program should read the

given dictionary.txt file with the

format:

Sample run of the program using the dictionary file given on the

left:

ABACUS

ABANDON

ABANDONED

ABBREVIATE

ABILITY

ABLE

ABOUND

ABOUT

ABOVE

ABRACADABRA

ABSENCE

ABSENT

$...$

input $->$ java spellcheck.java dictionary.txt

input $->$ able

output $->$ correct word

input $->$ abo

output $->$ misspelled? abound, about, above

input $->$ absenn

output $->$ misspelled? absence$,$ absent$,$ abacus