Problem$3]$ Design a finite state machine $($FSM$)$ for a counter that counts through

the $3-$bit prime numbers downwards. Assume the counter starts with

initial prime value set to $010$ as its first $3$ bit prime number. You

need to provide the state transition table and the state transition

diagram. Assume that the state is stored in three D$-$FFs$.$

Hint: The set of all $3-$bit prime numbers includes $2,3,5$ and$7.$