Question $2$

Pushdown Automata

Build a deterministic pushdown automaton $($DPDA$)$ that accepts the language

$L=\{(ab{)}^{n+2}(ba{)}^{n}aa,|n>0\}$ over the alphabet $L=\{a,b\}.$

For shortest word accepted $(3$ marks$)$

General words accepted $(4$ marks$)$

For general words which should be rejected $(3)$

GMT $+2-11$am plz b onlyn