Describe the state transition diagram for a Deterministic Finite Automaton (DFA) that accepts binary strings containing an odd number of 0s and an even number of 1s. Explain the function of each state and the reasoning behind every transition.