Q9. Consider the following grammar: V = {S, A, B }, T = { a, b }, and productions S AB A Bb B A12 (a) Show leftmost and rightmost derivations of the string abb? (b) Draw the parse trees for the two derivations in (a) and interpret the results. Q10. (a) Give a simple expression for the language L(G) generated by the grammar with production rules: Saaa A, A bbs, S (b) Find three strings in the above language