$(3\mathrm{.}15)$ Show that the collection of decidable languages is closed under the operation of

$($a$)$ union

$($b$)$ concatenation

$($c$)$ star

$($d$)$ complementation

$($e$)$ intersection