(35 points) Write a program (in C++ or Java) to minimize a DFA stored in a file in the format shown below. The program should take as input a DFA read from a file and should output the minimal DFA to a second file using the same format. Test your program with the input below. Submit your original, well-documented code, your input file, and your output file. Alph = {a ,b} States = {0,1,2,3,4,5,6,7} Starting State = 0 Final States = {2,3,5} Transition Table = 0 a 1 0 b 3 1 a 0 1 b 2 2 a 5 2 b 4 3 a 5 3 b 3 4 a 4 4 b 7 5 a 5 5 b 4 6 a 4 6 b 1 7 a 4 7 b 7