3. 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 3,4 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),(3,4)} The states of the minimum-state DFA are: ( 2 points) (set notations) or (equivalence class notations)