1. a. Draw the state diagram for push down automata M1 that recognize the language.

b . Write the formal definition of M1.

U U L = { a' bick | i=j or j=k where i, j, k >0}