For the grammar in the question, what is a correct recursive-descent procedure for A?

Consider the following grammar: S bSC | A A aA | C c

A. A: if lookahead = a then match(a); A; else error; fi B. A: if lookahead = a then match(a); A; fi. C. A: if lookahead = a then match(a); A; elseif lookahead = b then match(b); S; C; else A D. A: if lookahead = a then match(a); A; elseif lookahead = b then match(b); S; C; else