Consider the language L over Σ = 0, 1. L: All strings should contain at least…

Consider the language L over Σ = 0, 1.

L: All strings should contain at least one 0 and one 1.

Total number of states in Minimal DFA is/are ____