Consider the CFG, G = (V,T,R,S) where V = {A, B, S}, T={a,b} and R is given by the following productions: S AB aaA B bbBa la (a) (7 pts) Write down the CFL La generated by G above. (b) (8 pts) Can the strings: (i) u; = a*ba and (ii) uz = a*b*a? be generated by G? If so draw the corresponding parse tree for these strings. (c) (10 pts) Construct a PDA P=(0, E, , 8,qo, Zo, F) that accepts the language Lg