Professor Martinez needs a state machine that will recognize the sequence $010$ when

typed on a keypad. Specifically, it must read any sequence of the digits $0$ and $1.$ It should

move into an end state immediately after seeing $010($regardless of what came before the

$,$ and then remain in that end state as further characters come in$.$ For efficiency, the

state machine must be deterministic. Specifically, if you look at any state $s$ and any action

$a,$ there is exactly one edge labelled a leaving state $s.$

Draw a deterministic state diagram that will meet his needs. $($Hint: this can be done using

just $4$ states.$)$

DFA Builder Instructions