State Diagram for Deterministic Finite Automata

= {0,1}. Give a state diagram for the DFA that accepts the language {w | every even position of w is a 0 and every odd position of w is a 1}