*Ignore the algorithm part, solve it by whatever method you know*

1. If possible, minimize the following dfa using the algorithm we learned in class. Show your work, then draw a state table for the reduced machine. Present state Output 0 1 2 3 4 5 6 7 Next State Present Input 0 1 7 1 0 3 5 1 7 6 5 6 2 3 3 0 4 0 1 1 0 1 0 0 1 0 1. If possible, minimize the following dfa using the algorithm we learned in class. Show your work, then draw a state table for the reduced machine. Present state Output 0 1 2 3 4 5 6 7 Next State Present Input 0 1 7 1 0 3 5 1 7 6 5 6 2 3 3 0 4 0 1 1 0 1 0 0 1 0