Question 1.5: Each of the following languages is the complement of a simpl...

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}.

A a. \{w \mid w does not contain the substring ab\}
{ }^{A} b. \{w \mid w does not contain the substring baba \}
c. \{w \mid w contains neither the substrings ab nor ba\}
d. \left\{w \mid w\right. is any string not in \left.a^{*} b^{*}\right\}
e. \left\{w \mid w\right. is any string not in \left.\left(a b^{*}\right)^{*}\right\}
f. \left\{w \mid w\right. is any string not in \left.a^{*} \cup b^{*}\right\}
g. \{w \mid w is any string that doesn’t contain exactly two a’s \}
h. \{w \mid w is any string except a and b\}