Q10. (25 points) Design a counter to produce the following binary sequence. Use J-K flip-flops. 1, 0, 3, 7, 2, 5, 6, 1, ... (a) (3 pts) Draw the state diagram, (b) (5 pts) Draw the next state table with the necessary values of I's and K's, (c) (6 pts) Draw the K-maps, (d) (6 pts) Derive the minimized logic expressions, and (e) (5 pts) Draw the simplified circuit diagram. The state transition table for the J-K flip-flop is as follows: Output Transitions Flip-Flop Inputs J K QN Q N+1 0 0 0 X 0 1 1 X 0 X 1 1 1 X 0