5. (4 points) Let the set of states for a DFA be S = {0, 1, 2, 3, 4, 5}, where the start state is 0 and the final states are 1, 3 and 5. Let the equivalence relation on S for a minimum-state DFA be generated by the following set of equivalent pairs of states: { (0, 2), (1,3)} The states of the minimum-state DFA are: T s (set notations) et notations) or (equivalence class notations) You only need to answer one of the above two cases