Need urgent help if anyone can provide me solutions of these two below questions: Advanced Theory of Computation Question No. 1: Convert the following PDA to a context-free grammar. P = ({q, p}, {0, 1}, {Z0, X}, δ, q, Z0, {p}) has the following transition function: 1. δ(q, 0, Z0) ={(q, XZ0)} 2. δ(q, 0, X) = {(q, XX)} 3. δ(q, 1, X) = {(q, X)} 4. δ(q, ε, X) = {(p, ε)} 5. δ(p, ε, X) = {(p, ε)} 6. δ(p, 1, X) = {(p, XX)} 7. δ(p, 1, Z0) = {(p, ε)} Question No. 2: Below is a context-free language. Devise a PDA that accepts the language by empty stack. First construct a grammar for the language, and then convert to a PDA. • {anbmc2(n+m) | n ≥ 0, m ≥ 0}