1. Implement a generic Map that supports the insert and lookup operations. The implementation will store a hash table of pairs (key, de?nition). You will lookup a de?nition by providing a key. Figure 5.56 provides the Map speci?cation (minus some details).
2. Implement a spelling checker by using a hash table. Assume that the dictionary comes from two sources: an existing large dictionary and a second ?le containing a personal dictionary. Output all misspelled words and the line numbers on which they occur. Also, for each misspelled word, list any words in the dictionary that are obtainable by applying any of the following rules:
a. Add one character.
b. Remove one character.
c. Exchange adjacent characters.