Please help this is for Automata and Formal languages.

Build transition diagrams for deterministic finite automata that accept the following languages. Ensure that the transition function of your DFA is total. (No shorthand notation, please.) {w {{0. 1}*: w begins with a 0 and ends with a 1}. {w {0.1}*: w has length at least 1 and its third symbol is a 1). {w {0, 1}*: w contains at least one 0 and at most two 1's}. {w {0, 1)*: the number of 0's is divisible by 4 and the number of 1's is divisible by 2}