Draw the state diagram for the push down automata M1 that recognizes the following language

a. Write the formal definition of M1

b.

L = { albick | i=j or j=k where i, j, k >0} Draw the state diagram of DFA Mi for the following language. The alphabet is {0,1} {ww contains at least two Os and at most one 1}