How to solve this:

a. Create graph using words as vertices, and edges connecting words with a Levenshtein distance of 1. Use the misspelled word "moke" as the center, and try to find at least 10 connected dictionary words. How might a spell checker use this graph?

b. Improve the method from above by assigning a weight to each edge based on the likelihood of making the substitution, addition or deletion. You can base the weights on any reasonable approach: proximity of keys on keyboard, common language errors, etc. Include the weights on your graph from part (a) and explain how you assigned the weights.