For questions 1, 2, and 3 use the following 10 grammars. Uppercase (lowercase) letters stand for nonterminals (terminals) and S is the start symbol in each grammar. G1 : S + a Sb | ab G2: S bDc | Db | b D bbDc | b | G3 : G4: S + Sc abs absc abb Acc b S + Sc EC E + ab | aEb G5 : G6 : S + ap | 6V U + 6S b V + as a S + CES | S | b CE + cdscd G7: G8: S + AB AB BA B b S + bS as abbs abbb | abba AA a A ab A a a G9 : S + b | c | bbs | G10: S + bbScH H + + cHdd cd 3. Answer the following. (a) Show that G9 has at least one sentence in L(G9) that has two distinct rightmost derivations. (b) Does this prove that G9 is an ambiguous grammar? (c) How can one demonstrate that the language L = L(G9) is not inherently ambiguous