(1-5)Using the alphabet = {a,b], give a DFA for each of the following languages: 1. L = {wiaw, : wil > 3,w2 2, m > 3} 3. L = {waw2 : W1,E *} 4. L = {ba": n > 1, n 75} 5.L = {a" bm : (n + m) mod 5 > 2} 6. Find an NFA with four states that accepts the language L = {a" : n >0} 7. Show that the set of all complex numbers Cis a regular language. {"a:n > 1}