please solve c , d , e , f , g , h

1.5 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. {ww does not contain the substring ab A b. {ww does not contain the substring baba } c. {ww contains neither the substrings ab nor ba } d. {ww is any string not in ab} e. {ww is any string not in (ab++)} f. {ww is any string not in ab} g. {ww is any string that doesn't contain exactly two a's } h. {ww is any string except a and b}