Given a dictionary D and a text T, describe how to use a hash table to efficiently (a) find all words of T that do not appear in D, and (b) for each such word w, generate a list of words from D that could be correct spellings of w. Your solution for (b) should handle at least one of the following common misspelling types: swapping two adjacent characters, inserting an extra character, deleting a single character, and replacing a character for another. What is the running time of your method?