For an arithmetic expression using +,-, *, and / operators, the following grammar is given EEAE (E) I-E id A++ |- */ Where variable set is V={E,A} and terminal set is T={id, -;+,*,/}. Starting symbol is E. 1) Using grammar rules, show if string of tokens: a- w=(id+id)+id and b- w=((id+id)*id are acceptable by the grammar or not. 2) Why this grammar is left-recursive? Explain. 3) Eliminate left recursion of the given grammar. 4) Construct Transition diagram for its predictive parser 5) Show why id+id is accepted the transition diagram you have constructed in problem 4