Let us consider A = (Q, , , q0, Z0, A, ) a pushdown automaton with Q = {q0, q1, q2, q3}, A = {q3}, and the transition function given below: Figure Ex 2 Unit 2.pdf What language does it accept?

1.{ww^r | w {a, b, c}⁺}, where w^r means the reverse string of w;

2.{aⁿ(cb)ⁿ | n 1};

3.{aⁿw | w {b, c}⁺, |w| = 2n, n 1}, where |w| means the length of string w;

4.{aⁿ(bc)ⁿ | n 1};

5.None of the above

Move # | State | Input | Stack to Move (qi, aaZo) qi, aaa) (Y2, A) (42, A) (q2, A) (Y2, A) (gs, A) 2. 3. 4 5. 8. All other combinations