Give the state diagrams of a deterministic finite automata (DFA) recognizing the following languages. In all parts, the alphabet is {0, 1}.

3. Give the state diagrams of a deterministic finite automata (DFA) recog- nizing the following languages. In all parts, the alphabet is f0, 11 (b) f (w) S 3 (c) f I wl is an odd if it starts with a 0, otherwise is Iwl is even (d) tw l W doesn't contain the substring 110h (e) f I w 11 and w 1111 (f) tw I w contains an even number of 0s, or exactly two 1sh (g) The empty set. (h) All strings except the empty string. wl mod 3 mod 5 0 (k) l (n1 2mo(w)) mod 3 2) (w)