To convert an npda to a cfg$,$ each transition will be translated into one or more

grammar rules using the variable naming convention $q_{i}A{q}_j($or $A_{ij}$ for simplicity$).$

According to this, please:

$($a$)$ Translate this transition $(q_1,a,A)=\{(q_1,)\}$ into grammar rules.

$($b$)$ Translate this transition $(q_1,a,A)=\{(q_0,BC)\}$ into grammar rules. Assume the

npda has only two states: $q_0$ and $q_1.$