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.

1. (10 point) {w \w is any string not in 1*0*}. 2. (10 point) {w/w is any string not in (01+)*}