Show that the collection of Turing$-$recognizable languages is closed under the operation of $($a$)$ union $($b$)$ concatenation $($c$)$ star $($d$)$ intersection