The answers for part a and b are below, please answer c and d.

1. Consider the Moore-type finite state machine specified by the following state-assigned table. Current State Next State output W-0 W-1 XY XY X y 00 1 1 01 01 0 0 10 10 11 0 1 1 1 1 0 0 0 1 example, the state with x 0 and y 1 as S01. (b) (10 points) Write two next-state expressions, one for X and one for Y, that will implement the transitions of the state machine. Please make your expressions as simple as possible, and use XOR gates and NOT gates only. c) (S points) Write an expression for output Z. Please make your expression as simple as possible. (d) (15 points) Draw a circuit which implement the state machine using D flip-flops and some basic gates