Aspell checker in a word processing program makes suggestions when it finds a word not in the dictionary. To determine what words to suggest, it tries to find similar words. One measure of word similarity is the Levenshtein distance, which measures the number of substitutions, additions, or deletions that are required to change one word into another. For example, the words spit and spot are a distance of 1 apart; changing spit to spot requires one substitution (i for 0). Likewise, spit is distance 1 from pit since the change requires one deletion (the s). The word spite is also distance 1 from spit since it requires one addition (the e). The word soot is distance 2 from spit since two substitutions would be required. a) Create a graph using words as vertices, and edges connecting words with a Levenshtein distance of 1. Use the misspelled word \"plar\" as the center, and try to find at least 10 connected dictionary words. Upload the graph here (*see below for "how to" and an example) Choosgl\"ile, No file chosen b) How might a spell checker use this graph