Show that the following languages are regular by constructing DFAs for each:

$($a$)$ L $=\{$ an $|$ n $>=3\}$

$($b$)$ L $=\{$ bbanb$|$ n $>=2\}$

$($c$)$ L $=\{$ an $|$ n $>=0$; n$!=3\}$

$($d$)$ L $=\{$ an $|$ n is either a multiple of three or a multiple of $5\}$

$($e$)$ L $=\{$ an $|$ n is a multiple of three but NOT a multiple of $5\}$