I. When implementing a "recursive descent parser", explain the approach to program the rule "N->t" - Where N is a non terminal, and t is a terminal II. Using the given grammar. Explain the process for the S->SalbBlaA A-> b implementation of a top down parser or LL parser B -> end III Reading bottom up tables Using the given a grammar, table, and the following trace of the process of parsing a given string "id +id * id" Perform 3 more steps tack Input didid id*id +idid ion Shift 5 Reduce 6 (goto [O FI) id5 F3 Grammar 2. E->T 3. T->T*F 4. T-> F 6. F->id The given LR table