1. Derive the string 0011 using right most derivations and hence show that the following grammar is ambiguous. Also, draw the derivation trees for the given grammar. A - AAI E | OA1 2. Construct the regular expression for the following Finite Automata using state elimination method. Verify the result using JFLAP tool 08-06 3. Using Pumping Lemma prove that following language is not regular. Use any two sample strings to prove: nnn L=ablo.b) > 0