Draw an FST that changes to and from [p] and [b], [t] and [d], and [s and [] in CMU pronunciation dictionary transcriptions. The input alphabet is the set of phonemes isted under phoneme set in the CMU pronunciation dictionary page (e.g. AA, AE, AH,.). The output alphabet is exactly the same as the input alphabet. Each string in the input language should be mapped to one or more similar string(s) in the output language, except that each B can remain a B or become a P, P can remain a P or become a B, and so on with T/D and S/Z Hint 1: this type of FST is sometimes referred to as a flower FST!) For example, here is the entry for the word buy: BUY B AY The input string B AY corresponds to the output strings B AY and P AY where each results from a different path in the non-deterministic FST