The table given below defines the transition function of a DFA. The start state of the DFA is C and the final states are F and G. E={a, b, c}. a b A H F C B H G 1 G | D D H F A E F B D F B F G G 1 E H H 1 H H H B G Use the algorithm discussed in the class to minimize the DFA. The name of each state in the minimum-state DFA should be formed from the state names of the given DFA in alphabetical sequence. Show the transition function of the minimum-state DFA as a table, with one row for each state and one column for each symbol in the alphabet. Also, be sure specify the start state and the final states of the minimum-state DFA