Please show and prove 6.

6. (Note: it can be shown that the class of Turing-recognizable languages is closed un- der union, concatenation, intersection and star operations.) [5pt] Prove that the class of Turing-recognizable languages is closed under the con- Hint: Similar question is answered in Exercise 3.16(a) of the textbook)