Give state diagrams of DFAs recognizing the following languages. In all parts, the

alphabet is $=\{0,1\}.$

$($a$)$ begins with $1$ and ends with $0$