A finite state machine has one input, X, and one output, Z. The output becomes 1 and remains 1 thereafter when, starting from reset, at least two 1s and one 0 have occurred as inputs, regardless of the order in which they appeared. Assuming that this is to be implemented as a Moore machine, sketch a state diagram for the machine.