The LL(1) parser table is given, and given grammar G(P): P ->id := E ; E ->EOT E ->T T -> id | integer O -> * | /

given grammar: G(P): P->id := E; WWW First set of given grammar, Follow set of com First D) = {id 3 Follow (P) = { $ 3 First LE) = {id, integer] First (T) = {id, integer] Follow LE) = { $ 3 Follow (T) = {*, /, $1 First (o)= {*, 13 Follow (O)= {id, integer] Fiordt (E)= {x1, 63 Follow (E)= { $3 E->EOT E->T Now, the 16) parse table is T->id | integer 0->*\/ M id integer * / PP id:=E; Escreen ENON E Error E E-TE ENTE' Error E' Eros Erhar E+OTE' E' + OTE' E' + T Tid Tintiger Error Entrer Estas o Error Errar O-+* EG QUESTION: input string id:=id * id / integer, Design a stack, input and output table for the given table (10 marks){with explanation}