NFA without ε-transitions which recognizes the language generated by the regular expression

Question

NFA without ε-transitions which recognises the language generated by the regular expression:

1(0 + 0(10)*0)0

here is what i've done so far..

Answer 1

I think you can add a branch in second 0-transitions to take a union operation. It is feasible in NFA. Here is a required NFA.

Answer 2

Here is a possible NFA for the language $1(0 + 0(10)^*0)0$: