Minimize the following DFA using Brzozowski’s algorithm. S…
Minimize the following DFA using Brzozowski’s algorithm. Show the resulting DFA after the first (backward) pass. Show the final resulting DFA after the second (forward) pass. You may choose the names for states in each DFA. Write each DFA in the following format, illustrated with the original DFA: States: 0, 1, 2, 3 Start state 0 Accepting states: 1, 3 Transitions: (0, a) = 1, (0, b) = 2, (1, a) = 1, (2, a) = 3, (3, a) = 3 (12 pts)