A Moore finite state machine has two inputs and $Y)$ and one output $Z.$ Let $N_x$ be the

number of $1\text{'}$s received so far on the input $x.$ Also, let $N_Y$ be the number of $1\text{'}$s received so

far on the input $Y.$ The output $Z$ is equal to $1$ when the following conditions are satisfied:

$N_{x}2$ and $N_{Y}3.$ Assume that the output $Z$ is initially $0.$ Draw the state diagram of this

machine using the minimum number of states.