Please explain your answer for both questions. For the first part n is greater than or equal to zero Construct an npda that accepts the following language on E = {a,b} L3{d*b3n | n20} Explain your...

Please explain your answer for both questions. For the first part n is greater than or equal to zero


Extracted text: Construct an npda that accepts the following language on E = {a,b} L3{d*b3n | n20} Explain your solution and show the transition graph (clearly label nodes and edges)

1 "/>
Extracted text: Let L={a"b" | n2} Show that Lk is context-free for all k > 1