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