For each of the languages given below, draw the state diagram of a DFA that recognizes it. In all parts, = {0,1}. (1) {w|w does not contain the substring 0101 } (2) {w|w contains neither the substrings 01 nor 10}