Consider the language L over ∑= {a, b} such that L: All strings containing at…

Consider the language L over ∑= {a, b} such that

L: All strings containing at least one “b” or at least two “a’s”.

The total number of states in the minimal DFA accepting the language L is going to be ________.