Please help with this computer science problem. Thank you :)

Provide the state diagram of An NFA with five states that recognizes the language {w l w starts with 1 and every 0 is followed immediately by at least one 0, except the last 0}. = {0,1}