Question $3.$ In the previous question you implemented a combinational circuit $($no sequential elements like flip flops$)$ that performed the mod $3$ function

on a $4-$bit input. You can imagine that if we needed to perform mod $3$ on a

larger number, e$.$g$.9$ bits, that the circuit would become much larger.

Turns out, there is a state machine that will accept the bits of a number,