A garage door opens if it ever sees the password $011$ in a transmission. More formally, this FSM takes a bitstring consisting of $\text{0's}$ and $\text{1's}$ as its input, and continually outputs $\text{0's}$ until it sees the substring $011,$ after which it outputs $\text{1's}$ continuously. Example executions of this FSM are below:
For each of the numbered arrows, which of the following marks the correct FSM state transition?
- Arrow $1 - (0/0)$
- Arrow $3 - (1/0)$
- Arrow $4 - (1/0)$
- Arrow $5 - (1/1)$
