$2.($Sipser$,$ problem $1\mathrm{.}6,$ e$,$h$,$k$)$ Give state diagrams of DFAs for each of the following

languages. In all parts, the alphabet $\backslash$Sigma $=\{0,1\}.$

$($a$)\{$w$|$w starts with $0$ and has odd length or starts with $1$ and has even length$\}.$

$($b$)\{$w$|$w is any string except $11$ and $111\}.$

$($c$)\{,0\}.$