Myhill Nerode Theorem says that number of states in the smallest deterministic finite automata recognizing a language is equal to the number of equivalence classes in that language.
Minimizing the DFA we get the states : (1,6),(2,5),(3,4).
Number of states after minimization are 3 but (2,5) is unreachable state.
So.number of equivalence classes is 2.