Converting along regular expression to NFA
What you need is the Berry-Sethi algorithm, constructing the Glushkov's automaton.
However, for your problem, I'd consider constructing directly a DFA with $10 = \begin{pmatrix}5\\2\end{pmatrix}$ states corresponding to words of size 5 containing exactly two zeros, and a sink state (and maybe some other states for the begining of the reading).
The Glushkov's automaton on your regular expression will be very big.