Design the minimum$-$state DFA that accepts all and only the strings of $0\text{'}$s and $1\text{'}$s that end in $010.$ When considering the derived automaton, there is$/$are loop$($s$)($transitions from a state to itself$)$ on input $0$ and loop$($s$)$ on input $1.$ Furthermore, there is$/$are state$($s$)$ that have$/$has $2$ in$-$transitions on input $1($including loops$).$ there is$/$are state$($s$)$ that have$/$has no in$-$transitions on input $0.$ There is$/$are state$($s$)$ that have$/$has three in$-$transitions on input $0.$ There is$/$are state$($s$)$ that have$/$has one in$-$transition on input $0.$