(1-5)Using the alphabet E = {a, b}, give a DFA for each of the following languages: 1. L = {w awz : |wi|> 3, Jw2| 2, m > 3} {wiawz : w1, w2 E E*} {ba" : n > 1, n 5} 5. L = {a"bm : (n + m) mod 5 > 2} 6. Find an NFA with four states that accepts the language L = {a" : n > 0}U {b"a : n > 1} 7. Show that the set of all complex numbers C is a regular language. 2. L = 3. L 4. L = %3