Consider the context-free grammar G = (V, E, R, S) where V = {S, A, B}, { = {a,b} and R has the rules S AaB A aS | AA B bSBB Intuitively, A generates strings with one more a than b's, B generates strings with one more b than a's, and S generates the strings with equal numbers of a's and b's. Q12.2 Part (b) 4 Points Give a rightmost derivation of the string a ababb. Enter your answer here Please select file(s) Select file(s) Q12.3 Part (c) 3 Points Draw a parse tree for the string abba Please select file(s) Select file(s)