Question

What is the number of states required in minimal DFA to accept the string
that contains exactly 2 a's and 3 b's over the input alphabet {a,b}?
(A) 6
(B) 11
(C) 12
(D) 13​

Answer 1

Answer is option c). 12