Draw a state diagram for a Finite State Machine with one input, z, and three outputs, a, b, c. abc should always follow the following sequence when z = 0: 000, 001, 011, 111, 101, 100, 110, 010, repeat. abc should go to the previous value (i.e. 011 to 001) when z=1. The output should only change on a rising clock edge. Make 000 the initial state.