Suppose G is an unrestricted grammar with start symbol T that generates the language L ⊆{a,b}∗. In each part below, another unrestricted grammar is described. Say (in terms of L) what language it generates. a. The grammar containing all the variables and all the productions of G, two additional variables S (the start variable) and E, and the additional productions S →ET E→ Ea→E Eb→E b. The grammar containing all the variables and all the productions of G, four additional variables S (the start variable), F, R,andE,andthe additional productions S →FTR Fa→aF Fb→bF F→E Ea →E Eb→E ER