The following language is the complement of a simpler language. Construct a Deterministic Finite Automata for the simpler language, then use it to give the state diagram of a DFA for the language given. In this part, = {a,b}.

{w | w is any string not in (ab⁺)*}