I) Given G: { s---> aSb |c| ab } derive the string aabb L(G) with 5 backtracking in 18 steps (should be proved as given in the question)

II) construct a NPDA( Non-Deterministic Push Down Automata for L= {a^(n+1) b^n | n>=1 } with final state.

I. Given G:{SaSb|c| ab}. Derive the string aabb E LIG with 5 backtracking in 18 steps (should be proved as given in the question). II. Construct a NPDA (Non-Deteministic Push Down Automata for L={q"+6"|n>=1} with final state. Alne from your second decon