a)Construct a deterministic push down automaton that accepts the following language:

{0ⁿ 1^m/ n m }.

b)Find a context-free grammar that generates the language accepted by the PDA

P = ({q0,q1},{a,b},{A, Z0}, , q0,Z0,{q1} with the transitions: (q0, a, Z0) = {( q0, AZ0)} (q0, b, A) = {( q0, AA)} (q0, a, A) = {( q1 , )}

c) Is the following grammar ambiguous? Why? S aSbS | SbaS |