Design a state machine which meets the following specifications:
1. When x=00 it holds in the current state
2. When x=01 it counts up 0-1-2-3-4-5-0- ...
3. When x=10 it counts down 5-4-3-2-1-0-5- ...
4. When x=11 it resets to 0
Instructions:
a. Construct a state diagram showing all states and transitions ( label all transitions)
b. Construct a truth table for the state machine showing all possible states and the logic solution using J-K flip-flops.
c. Construct K-maps for the J-K solutions, identify the minimum logic implementation (circle groups on K-maps), and write equations for J's
and K's