If we convert the context-free grammar G: S AS | A A 0A | 1B | 1 B 0B | 0 to a pushdown automaton that accepts L(G) by empty stack, using the construction of Section 6.3.1, which of the following would be a rule of the PDA? a) (q,,S) = {(q,AS), (q,A)} b) (q,,A) = {(q,0A)} c) (q,,B) = { (q,0)} d) (q,0,B) = {(q,B), (q,)}