A$.5$ A Smart Snail

In this question, you will implement a finite state machine $($FSM$)$ for a smart snail robot.

Similar to the snail example discussed in class, your smart snail robot follows a path of $\text{'}0\text{'}$ and $\text{'}1\text{'}$ and uses the detected digit as input. However, your smart snail doesn't like long strings of the same digit. In particular, this is how your smart snail robot behaves:

$-$ The snail follows a path of $\text{'}0\text{'}$ and $\text{'}1\text{'}$ and uses that as input.

$-$ If your snail sees $3$ or more of the same digit, it outputs an angry face by asserting a $\text{'}1\text{'}$ in its tm output $($stands for Too Many$).$ It also outputs the digit that is being repeated in its oz $($one or zero$)$ output.

$-$ The snail's angry face will only be reset after encountering $2$ or more consecutive input of the opposite digit.

The following shows a sample timing diagram of the action of your smart snail:

Your task for this question is to design an FSM that implements the smart snail robot's brain. Specifically, you will design a circuit called ssbrain which has the following input and output signals:

A$\mathrm{.}5\mathrm{.}1$ Describe the decision logic of the snail with a state transition diagram. Your design should ensure that it produces the correct timing for tm and oz as shown in the example timing diagram above. Submit this part of homework as part of your written exercise.

A$\mathrm{.}5\mathrm{.}2$ Implement your design in VHDL$.$ Save your VHDL design as ssbrain. vhd and submit it in GradeScope.