Please help me with this homework problem, and explain how to do it

2. Context free grammars, LL parsing Consider the following grammar: T id | id() | id(L) The nonterminals are E, T, and L. The terminals are +, id, (.). The start symbol is E. (a) Modify the grammar such that it can be parsed by an LL) parer (b) Show Nullable, FIRST, and FOLLOW and derive the LL(1) parse table for the modified gram- mar. (c) Give the (non-abstract) parse tree produced by your grammar for the input a b(c, d))