What is the minimum number of states required to the finite automaton equivalent to the transition diagram given below?

Step 1: {a, b, e, f, g, h} {d} {c}

Step 2: {a, e, f, g} {b, h} {c}

Step 3: {a, e} {f} {g} {b, h} {c}

d have no incoming edges so we have discard them.

In the above steps we can see that the minimised finite automata we get have the 5 number of the states.

So we can say that the correct option is the option 3).