Answer
Their will be four transitons of odd number of 0s
Work Step by Step
finite-state automaton that recognizes the set of all bit strings that contain an odd number of 0s.
Start state $s_0$, only final state $s_1$;
transitions
from $s_0$ to $s_0$ on 1,
from $s_0$ to $s_1$ on 0,
from $s_1$ to $s_1$ on 1;
from $s_1$ to $s_0$ on 0
