Please give me correct and clear answers. Thank you

1. Find a dfa that accepts the following language: (10 Points) L (aa aba b') 2. Find an NFA that accepts the language L (aa* (ab + b) (10 Points) 3. Convert the nfa defined by, (q0, a)-(q0, q1), (q 1, b)-(q1, q2), (q2, a-{q2),5 (go, )-(q2) with initial q0 and final state q2 into an equivalent dfa. (10 Points) Consider the dfa with initial state go, final state q2 and (q0, a)-(q2) 4. 5 (q3, b) [q1); Find a minimal dfa. (10 Points 5. Find a regular expression for the set fanbm: n 2 3, m is odd] (10 Points) - [q2), 6 (q2, b) fq3)