A Moore finite state machine has one input x and one output z$.$ The

output becomes $1$ and remains $1$ thereafter when at least two $0$s and two

$1$s have occurred as inputs, regardless of the order of the appearance.

Assuming this is to be implemented as a Moore machine:$-$

a$.$ Draw a state transition diagram for the machine. Hint:You can do this

in nine states.

b$.$ Make straight binary assignment to the states and derive the flip$-$flop

input equations and output equation for your design.

Draw the logic diagram of the circuit using negative edge$-$triggered JK

and external NAND gates as required.