To convert an pda to a cfg, each transition will be translated into one or more grammar rules using the variable naming convention qiAqi (or Aij for simplicity).
According to this, please:
(a) Translate this transition (q1, a, A) = {(91, 2)} into grammar rules.
(b) Translate this transition o(q1, a, A) = {(qo, BC)} into grammar rules. Assume the
pda has only two states: do and q1.