PLEASE SOLVE WITH PENCIL AND PAPER. This is a compiler construction related question.

Given is a code snippet for recursive procedures of Recursive Descent Parser. Go through the code and write down the context free grammar being implemented by this code: E() \{ T(); E_Prime(); E_Prime() \{ if(input ==+ ) Input++; T()