1. Let M be the PDA defined by Q= {90, 91, 92} Σ= {a, b} 8(qo, a, 2) = {[qo, A]} 8(qo, b, λ) = {[q1, 2]} T = {A} F = {92} 8(q1, b, A) = {[q2, 2]} 8(q2, b, A) = {[1, 2]} a. Describe the language accepted by M. b. Give the state diagram of M. 5. The machine M below accepts the language L = {a¹b¹ | i≥ 0} by final state and empty stack. M: a NA b A 88 b A q1 a. Give the state diagram of a PDA that accepts L by empty stack. b. Give the state diagram of a PDA that accepts L by final state. 6. Convert the following context-free grammar to a PDA that accepts the same language. SaSa bSb | B B → bB λ