QUESTION 12 Recall Question 10 grammar G: STS | T Ty | xTy | xy The grammar is: None O a. O b.Ambiguous because two parse trees can be obtained for some strings. OC. Ambiguous because S has two possible derivations, d. Not ambiguous because we can transform it to a non-ambiguous grammar. QUESTION 13 The language L = {xy }is: a. Context-free language b. Regular and context.free language c. Regular language O d. None