A 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, E = {a, b}. twtwduos the obowing av Ab. foedoonor tumain di subsuing baba; c. {ww contains neither the substrings ab nor ba} d. {ww is any string not in a*b*} e. {w/w is any string not in (ab+)*} f. {w/w is any string not in a* Ub*} g. {w/w is any string that doesn't contain exactly two as} h. {w/w is any string except a and b}