Give state diagrams of deterministic finite automaton (DFA) using the following languages. In all cases = {0, 1}.

1. {w | w starts with 0 and has odd length, or starts with 1 and has even length} 2. {w | w does not contain the substring 110} 3. {w | the length of w is at most 5} 4. {w | every odd position of w is a 1} 5. {w | w contains at least two 0s and at most one 1}