For each of the following languages, give a regular expression that describes it$.$ In all parts, the alphabet is E $=\{$c$,$ d$\}.$

$($a$)\{$w in E$|$ w contains at least three c$$s$\}$

$($b$)\{$w in E$|$ w starts with c and has odd length, or starts with d and has even length$\}$

$($c$)\{$w in E$|$ the length of w is at most $5\}$

$($d$)\{$w in E$|$ w is any string except cc and ccc$\}$

$($e$)\{$w in E$|$ every odd position in w is a c$\}$