given grammar: G(P): P -> id := E; WWW First set of given grammar, Follow set of com First) = {id 3 Follow lp) = $3 Fost LE) = {im integer] Follow le) = { $3 First (T) = {id, integer] Follow (T) = {*. 1$1 First (o) - {*} Follow (O)= {id, integer] First LE') = { 1,63 Follow (EU)= { $3 E->EOT E->T Now, the uw) parse table is T->id | integer 0->*\/ INT id integer k / Pid: - Enduen ES Error Error E ETE ETE' Error EAN ENOR E' Eros Eras E+OTE' E OTE' E'+ T Tid Tintige Error Error Eseros O Error Esar O* Error QUESTION: Design a stack, input and output table for the given table (10 marks){with explanation}