Consider the grammar G = (V,Sigma,R,S), where V={a,b,S,A}, Sigma ={a,b}, R= {S->AA, A->AAA, A->a, A->bA, A->Ab}. a. Which strings L(G) can be produced by derivations of four or fewer steps? c. For any m,n,p > 0, describe a derivation in G of the string b^m ab^n ab^p