Build transition diagrams for deterministic finite automata that accept the following languages. Ensure that the transition function of each DFA is total (every state has a transition out on every input character).

(a) {w {0, 1} : w contains the substring 010}.

(b) {w {0, 1} : w does not contain the substring 010}.

(c) {w {0, 1} : w ends with the substring 010}.

(d) {w {0, 1} : w has length 3 and its third symbol is 1}.