Problem 3: DFA Encodings Let D(Qn) denote the set of DFAs with states Qn-140.91-2, . . . , gn} and alphabet {a, b). Our encoding will be(M) : D(Qn) * where the encoding alphabet is -{0, 1, 2, 3, . ..,n, $, : ,&J Define (M) to be the string beginning with 'S' and then the encoding of the transition function of M, followed by a colon delimiter, and the start state of M, followed by a colon delimiter, and then the accept states in numerical order separated by '&'. The transition function is encoded as a set of states separated by '&', where the states are the right parts of all transitions listed in numerical and alphabetical order. Note that we use the index of a state to encode it; that is, go is encoded as 0 in our encoding, q is encoded as 1, and so on. 40 91 a, 42