Please design a reversible state machine with the following sequence: $($start$)3$harr$5>6>4$harr$1$harr$3$dots

Submit three different reversible state machine circuits:

a Standard Sum$-$of$-$Products implementation $($remember$,$ this one is supposed to be easy; don't overthink it$.)$

a Minimum Sum$-$of$-$Products implementation

a Nand implementation $($using only $2-$input nand gates$)$

Submit using the following file$-$name formats $($using your initials$)$:

init$\_$SSOP$\_022324.$circ

init$\_$mSOP$\_022324.$circ

init$\_$nand$\_022324.$circ