A circuit has only one input and one output, and $4$ states as shown in the Finite State Machine $($FSM$)$ diagram below.

Derive its state transition table $($truth table$)$ that matches with the FSM diagram. In the truth table, for each row, show all unique input, current$-$state, next$-$state, and output values $-$

this is so a hardware implementation of each transition in the FSM can be performed.

When determining the number of rows for the table, similar to a truth table, pay attention to the number of states, number of inputs, and possible values for each input.

Note#$1$: $"0/1"$ below means $0$ is the input value and $1$ is the output value.

Note#$2$: $"0,1"$ below means when the value is either $0$ or $1.$