Each of the following languages is the complement of a simpler language.
In each part, construct a DFA for the simpler language, then use it to give the state diagram of a DFA for the language given.
In all parts, Σ = {a, b}.
1- {w| w does not contain the substring ab}
2- {w| w does not contain the substring baba}
3- {w| w contains neither the substrings ab nor ba}
4- {w| w is any string not in $a^{*}\cup b^{*}$ } ( ∪ is the union )
