I need help creating the state diagram, state table, karnaugh maps & Boolean functions, and whether the circuit is self correcting with proof.

CS2170 Project 2 Problem Description: Design a sequential circuit with three flip-flops and one input x. When x 0, count 0, 2, 3, 5, 6 and repeat. when x = 1, count 6,5, 3,2,0 and repeat. Your answer should include a state diagram and a state table. It should also include Karnaugh-maps and Boolean expressions for eac D flip-flop. You should also prove whether or not the circuit is self-correcting. Create and test this Circuit in LogicWorks. You can show your state diagrams, etc. in the space below and on the attached page). Name your LogicWorks file with your lastname, first initial and Proj2. Use cct as the file extensio For example, if your name is Thomas Watson, your file would be named WatsonT_Proj2.ect. .Be sure to make a backup of your circuit. What to turn in: Grade Sheet, assignment sheets showing your state diagram, state table, Karmaugh-maps oolean expressions and self-correcting proof. Staple all of these together with the Grade Sheet on top. Turn in your LogicWorks cct file on Canvas. State diagram