Consider the deterministic finite automaton (DFA) over the alphabet {a, b} and embodied by the transition diagram below. Use the table minimization algorithm provided in the lectures to determine which pairs of states are equivalent. Select the options below which are correct.