If we convert the context-free grammar G: SASIA A0A | 1B | 1 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) b) (q,e,A)= {(q, l); (q,,A) = {(q,0A), (q,IB), (q,l)} d) (q,e,S)= {(q,A))