Theory of Computation - Deterministic Finite Automation and Strings

Question

For Σ = {a, b}, construct a DFA that accepts the sets consisting of:

all the strings with an even number of a’s and the number of b’s is a multiple of 3. Note that 0 is an even number and a multiple of 3.

Answer 1

It's just a combination of two DFAs: (i) even number of a's; and (ii) number of b's to be multiple of 3.