Prove this theorem.
Theorem 5.1 (Myhill-Nerode). A language A is regular iff the equivalence relation \equiv_{A} has a finite number of equivalence classes. Furthermore, there exists some DFA M with L(M)=A such that every state of M uniquely corresponds to an equivalence class of \equiv_{A}.