(Dictionaries.py) Write the function longest word(W) that receives a list of words W and returns a dictionary D where D[c] contains the longest word in W that starts with letter c, for every letter c in the alphabet. Break ties by choosing the word that appears first in W. For example, if W =[alpha, beta, gamma, bear], D[b] should be beta, since beta appears before bear in W.