Question 1: For each of the following problems: (a) Specify the language using text, e,g. L = {...} (b) Draw the DFSM that accepts the language. (c) Write the configurations for the computations of the given input strings and indicate if the machine accepts of rejects the string. Problems: 1. Strings over {a, b}* that contains no more than one b. Input strings: aa, aba, aabba, ababb, abababaaa. 2. Strings over {a, b}* where every a is followed by a b. Input strings: bbb, abbb, baabb, abababa, bababab. 3. Strings over {a, b}* that begins and ends with an a or begins and ends with a b. Input strings:aa, aba, aabba, bbabab, abab, babaaa. 4. Strings over {a, b}* where two consecutive a's are followed by a b. Input strings: aa, aba, bba, aabba, aabbaa, aabba, ababb, bbaaabaab. Question 2: A DFSM M is formally describes as ({91, 92, 93, 94, 95), (x, y), 93, {93), S) where delta is given by the transition table below. Draw the DFSM that corresponds with M1- X |y 191 91 92 92 91 q3 93 q2 94 94 93 q5 q5 94 q5