1. Derive the string bbaa using right most derivations and hence show that the following grammar is ambiguous. Also, draw the derivation trees for the given grammar. B - BB | Ba 2. Construct the regular expression using state elimination method. Verify the result using JFLAP tool. dood 3. Using Pumping Lemma prove that following language is not regular. Use any two sample strings to prove Lam.mm (0,1)>0