2. The language accepted by the automaton is {a^n b , n 0 }. a. Give state diagram of DFA recognizing the above language. b. Give the state transition table. c. Write the five tuples for the informal definition of DFA.

3. Give state diagrams of DFA recognizing the following languages. In all parts, the alphabet is {a, b}. a. {w | w is (, b, ab)} b. {w| w contains the substring abab (i.e., w = xababy for some x and y)}}