Automata and Computability

Show that the collection of Turing-recognizable languages is closed under the operations of
a. union.
b. concatenation.
c. star.
d. intersection