Design a DFA that accept the language below: L = { W⁄W has both an even number of 0’s and even number of 1’s}

Designing a DFA to accept the language
Where,
L = {W ⁄ W has both an even number of 0’s and even number of 1’s}
It should not be surprising that the job of the states of this DFA is to count both the number of this DFA is to count both the number of 0’s and the number of 1’s but count them modulo? The state is used to remember whether the number of 0’s seen so far is even or odd, and also to remember whether the number of 1’s seen so far is even or odd. There are thus four states.

                                                                                                                                    (Answer)