Construct a Moore Machine that counts modulo 3 You have two external binary inputs X and Y, when XY=00 the counter will pause, when XY=01 it will count forward (as usual), when XY=10 the counter will count backward (lets suppose the current state is 1, then it will be 10210210...), when XY=11 the counter will count in modulo 2 (01010101...) draw a state transition diagram, Karnaugh map to derive the simplified boolean expressions for A* and B* as functions of X, Y, A, B and draw the circuit (using flip flops)