Describe the theoretical process of designing a Deterministic Finite Automaton (DFA) that accepts all binary strings containing an odd number of 1s. Detail the 5-tuple definition (Q, Sigma, delta, q0, F) for this specific machine. Explicitly list the set of states Q, the alphabet Sigma, the transition function delta as a table or set of rules, the start state q0, and the set of accept states F.