4. Consider the six-state Finite Automaton represented by the following table. b 4 state Start 1 2 3 Final 4 Final 5 Final 6 a 2 2 3 5 5 5 133FF 6 4 5 Convert this into an equivalent FA with the minimum possible number of states.