Minimize the number of states in the following DFA, showing the determination of incompatible states (table on right). Construct and write down your new, equivalent automaton!! a b c 6 44 5 >1 2 3 31415 2 5 1 4 3 5 2 6 2 4 4 1 2 3 4 5 6 >1 2 3 4 5