Problem $3$ Using D Flip flops and NAND gates, design a Moore finite state machine with one input x and one output z$.$ When x $=1,$ the circuit goes through the state transitions from QaQb $=00$ to $01,$ to $11,$ to $10,$ back to $00$ and repeats