Recall that a final state of a Turing machine T is a state that is not the first state in

any of the $5-$tuples that make up T$.$ Construct a Turing machine that recognizes the set of all

bit strings that end with the sequence $010.$ Write down $5-$tuples for the Turing Machine.

$($You will not receive credit if you only draw an FSM$.$ If you prefer that method, draw the

FSM first, then write down the corresponding $5-$tuples.$)$