Consider the DFAs M and N given above. The number of states

Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the languages L(M) ∩ L(N) is ________.

M accepts the strings which end with a and N accepts the strings which end with b. Their intersection should accept empty language.