Consider the language A over the alphabet $\backslash$Sigma $=\{0,1\}$:

A $=\{$w : w has $1$ as one of the last three digits$\}$

$($a$)$ Generate the state diagram for a DFA which decides A$.$

Make sure to clearly indicate your start state and final state$($s$).$