Regular Expressions 6. Give regular expressions that generate each of the following languages. In all parts, ={a,b}. (a) (6 points) L1={ww is odd }. (b) (6 points) L2={ww hass an odd number of a's }. 7. Convert the following regular expressions to NFAs. In all parts, ={a,b}. (a) (7 points) b(ab)+aa (b) (7 points) a+b(abb)a 8. Use the procedure described in Textbook Lemma 1.60 to convert the the following finite automata to regular expressions. For all questions the state removal order should be: q1,q2 (a) (7 points) M1 : (b) (7 points) M2 : Non-regular Languages 9. Use the pumping lemma to show that the following languages are not regular. (a) (5 points) A1={0n1n2nn0} (b) (5 points) A2={wwww{a,b}}