SpellChecker

Done with a dictionary as data, implement a spell checker class that takes this dictionary as input, this

The class has three main operations:

• Store this dictionary in an appropriate data structure.

The input word is taken and the closest 4 words are returned if this word is not present in the dictionary

• An input word is taken and this word is added to the dictionary

For each process determine the time and place complexity

Note: You can assume that the closest 4 words to a word are the two words before and

after this word in lexical order if it is present.