There's only 1 f, and if it does match, we still finish in an accepting state, which is exactly what happens when we go from state 3 to state 5, and so these are the portions of the finite state machine that we're missing that perfectly match the given regular expression. 