Question 1 Let X = {a} and Y= {b}. For n=0, 1, 2, 3, list the strings: b. Question 2 Consider the Languages and Grammars given below. Write the number of matched Language with the suitable Grammar in the blank column (blue shaded). NO LANGUAGE Matched language (No.) GRAMMAR 1 (a+b 2 (a+b): 3 (a+b) Sabab s- A AA BAT6 S-> ZA A55 SaSBS 2. Sa 6 4 5 (ab) ola +5)*6 Question 3 Let G be the grammar S = 9Salada A bo. a) Show the derivation of string gabbag and gaangaa 6 Build the derivation trees for the derivation in part (a). Use set notations to define L(G) Question 4 Build an NFA (with 2. if necessary) for the following language: a) M. that accepts abbal 6) Me that accepts a/bb*a(ab)