Give DFAs that accept the following regular languages over the alphabet $=\{0,1\}$

$($a$)\{,1,01,111,0010,1011\}$

$($b$)$ Binary strings of length $4$ or longer

$($c$)$ Binary strings where the number of ones is a multiple of $3$

$($d$)$ Binary strings that contain $010$ as a substring $($which also includes the string $010$ itself$)$

$($e$)$ Binary strings that do not contain $010$ as a substring