Draw state diagrams for deterministic finite automata (DFAs) that accept the following languages over the alphabet {0, 1}. Your DFA should never get stuck, i.e. you should include dummy states if necessary.

(a) { w | w contains the substring 0101, i.e. w = x0101y for some strings x and y}.

(b) { w | w does not contain the substring 011}.

By far the easiest way to prepare and submit your answer is to draw your DFAs (clearly!) on paper, take a photo or scan, and put the resulting image in a file. If you want to spend time generating your DFA diagrams on-line (e.g. using Powerpoint, latex, or a graphics editing tool), feel free to do so, but this isnt really recommended.