12. Convert the nfa defined by (m,a) {92} = with initial state go and final state q.into an equivalent dfa. 13. Prove that for every nfa with an arbitrary number of final states there is an equivalent nfa with only one final state. Can we make a similar claim for dfa's? Chapter 3 3.1 14. a) Find all strings in L((ab+b b(atab)') of length less than four. b) Find an nfa that accepts the language L(aa (abtb)). 15. Give regular expressions for the following languages. c) The complement of Li. d) The complement of L2 16. Determine whether or not the following claims are true for all regular expressions ri and ra. The symbol stands for equivalence of regular expressions in the sense that both expressions denote the same language. (a) (r1). ,1 English (US)