Design a 3-bit counter that follows the sequence: 1, 4, 6, 3, 7, 1, 4, 6, 3 Unused states (0, 2, 5) must go to a used state. Use the binary value of the count for each state assignment. So the sequence in binary will be: 001, 100,

This question is incomplete, here's the complete question:

Design a 3-bit counter that follows the sequence: 1, 4, 6, 3, 7, 1, 4, 6, 3.... Unused states (0, 2, 5) must go to a used state. Use the binary value of the count for each state assignment. So the sequence in binary will be 001, 100, 110, 011, 111, 001, 100, 110, 011.... Use D flip-flops. Repeat using X flip-flops. Note: There is no output to this state machine. The count (state) itself is what is desired.

Explanation:

kindly check the attached images below to see the step by step solution to the question above

answer; availability;