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, $\backslash$Sigma $=\{0,1\}.$ i$.\{$w$|$ w is any string that doesn$$t contain exactly two $1$s$\}$ ii$.\{$w$|$ w contains neither the substrings $01$ nor $10\}$