b$)(5$ pts$)$ Given two states s$0,$ s$1,$ complete the following diagram by adding arrows:

so that it becomes a state diagram of the finite state machine $M,$ which is supposed to recognize $($with an output $1)$ every $0$ appearing in an input string $x$ that is preceded by another $0.$