Question 5/20 points) We are using the alphabet {0, 1}. We have a DFA with 5 states, S = {80, 81, 82, 83, 84}. The start state is so and the only accepting state is also so. The transitions are given by the formula 8(si,a) = $; where ; = 12 + a mod 5. Draw the table showing which pairs of states are inequivalent and then construct the minimal automaton. Remember to remove useless states right from the start, before you draw the table. I am happy with a drawing of the automaton