Using D flip-flops and NAND gates, design a Moore finite state machine with one input x and one output z. When x = 0, the state of the circuit remains unchanged. When x = 1, the circuit goes through the state transitions from Q_A Q_B = 00 to 10, to 11, to 01, back to 00, and repeats. When in states 00, 01 and 10 the circuit output is 1, otherwise it is zero. Sketch the state diagram. Complete the state table in Table 1. In columns three and four, the notation x and x^bar indicates that the input is in a logic high-state and low-state, respectively. Use a two-variable Karnaugh map to obtain a logic equations in terms of Q_A and Q_B for the output z. Using the three-variable Karnaugh map in Figure 15, obtain logic equations in terms of x, Q_A, and Q_B for the flip-flop inputs D_A and D_B. Neatly sketch a logic circuit that realizes the finite state machine using only NAND gates