Designing a DFA for Even Zeros and Odd Ones
In this problem, we'll create a Deterministic Finite Automaton (DFA) that accepts strings containing an even number of 0s and an odd number of 1s. This means that the DFA will recognize strings with a specific pattern: any number of 1s, paired with an even count of 0s.
Try to draw the DFA which accept the given string
