Answer
Five states Will exist
Work Step by Step
finite-state automaton that recognizes the set of all bit strings that contain exactly
three $s_0$.
Have five states, with only $s_3$ final. For i = 0, 1, 2, 3,
transition from $s_i$ to itself on input 1 and to $s_i$+1 on input 0.
Both transitions from $s_4$ are to itself
