2. Consider the CFG G = ({S,A), {0, 1), R, S) where R is given by: (a) What is the language generated by G? (b) Prove that G is an ambiguous CFG (c) Show a right-linear grammar generating L(G). Recall that a right-linear grammar is a CFG where all the rules are of the form A aB or A E where A, B are variables and a is a terminal