1. (60 points) Consider the Moore-type finite state machine specified by the following state- assigned table. Current Next State Output State W=0 W=1 XY XY Z 00 11 10 1 01 00 11 0 10 01 00 0 11 10 01 0 (a) (20 points) Draw the state diagram of the machine. Please label the state with x-a and y=b as Sab. For example, the state with x=0 and y=1 as S01. (b) (20 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. You may use any basic gates. (c) (5 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.