C.13 and C.14 (a & b)

C.13) If a state graph has 12 states, what is the fewest number of flip-flops are needed to build it? How many states would be unused? C.14) Construct a Moore state machine that counts modulo 5. That is, it counts following the sequence 000,001,010,011, 100, and then back to 000. Assume that there is a synchronous reset input. If the synchronous reset input is asserted (1) in any state the next state should be 000. Also, if the machine happens to start in any of the unused states (101, 110 or 111) the next state should always be 000 whether or not the reset input is asserted. a) Draw a state graph representing this state machine. b) Give a present-state / next-state table for this modulo 5 counter