Help please. I need to write in Python a dimulator of a deterministic finite automata

number of zeros. function of the DFA works as follows: $ \ begin {array}{ccc} \& 0 \& 1 I \ hline q&r&q\1 r&q&r \lend{array} github-classroom[bot], 2 weeks ago - Initial commit $ whether a given string is such that the number of \$a\$'s is divisible by 2 and the number of $b$ 's is divisible by 3. So for example, the new DFA should accept the string but should reject abi in