Question $2$:

Create an FSM for a simple password entry system. The system requires a user to input a specific password consisting of a sequence of three characters: $\text{'}$A$\text{'},\text{'}$B$\text{'},$ and $\text{'}$C$\text{'}.$

The system should function as follows:

The FSM starts in the Initial state.

If the user enters $\text{'}$ A $\text{'},$ it transitions to the $S1$ state.

If $\text{'}$B$\text{'}$ is entered while in $S1,$ it moves to the $S2$ state.

If $\text{'}$C$\text{'}$ is entered while in S$2,$ it moves to the Accepted state, indicating the correct password has been entered.

If an incorrect character is entered at any state, it should return to the Initial state.

Draw the state diagram and provide the state transition table. What outputs $($if any$)$ are generated in each state, particularly when the password is successfully accepted?