Let $n_a$ be the number of $a$'s. The language needs $n_a\equiv0\pmod2$ **and** $n_a\not\equiv0\pmod3$. Whether $n_a$ is divisible by both 2 and 3 depends on $n_a\bmod6$, so the DFA must track $n_a\bmod6$ (6 states, the `b`'s do not change the state).
Accepting residues: even and not a multiple of 3: $n_a\bmod6\in\{2,4\}$. (Residue 0 is divisible by 3; residues 1, 3, 5 are odd.)
All 6 states are pairwise distinguishable (appending `a`'s from a state reaches an accepting residue after a different number of steps), so the minimum DFA has **6** states.
More Regular Expressions and Finite Automata questions
GATE 2019 CS Q58– Let be the set of all bijections from \1,,5\ to \1,,5\, where id denotes the identity…
GATE 2018 CS Q16– Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is…
GATE 2018 CS Q62– Given a language L, define Li as follows: L0=\\ and Li=Li-1 L for all i>0. The order of a…
GATE 2015 CS (CS1) Q49– [Two DFAs, each with two states. DFA M: the start state loops on b, reads a to move to the…
GATE 2016 CS (CS1) Q28– Which one of the following regular expressions represents the language: the set of all…
GATE 2017 CS (CS1) Q32– Consider the language L given by the regular expression (a + b)* b (a + b) over the…