Build a deterministic pushdown automata (DPDA) that accepts the language L={(ab)n(aa)m(ba)n11,m1} over the alphabet ={a,b}. Question 3 [12] The pumping lemma with length for context-free languages (CFLs) can be stated as follows: Let L be a CFL generated by a CFG in CNF with p live productions. Then any word w in L with length >2p can be broken into five parts: w=uvxyz such that length (vxy)2p length (x)>0 length (v)+ length (y)>0 and such that all the words uvnxynz with n{2,3,4,} are also in the language L. Use the pumping lemma with length to prove that the language L={(a)n(b)2n+2(a)n11} over the alphabet ={a,b} is non-context-free