Draw an FST that will use as input pronunciation representations, one symbol at a time, and produce the corresponding words as output. The input alphabet should be the set of phonemes in the CMU dictionary page (i.e. ? = {AA, AE, AH, AO, AW, B, CH, D, DH, ...}), and the output alphabet should be exactly ? = {language, languages, student, students}. (Pay close attention: the output alphabet is not the set of letters; it is those four symbols.) The output language should be ?*. For example, if the input string is the sequence of symbols