How would you go about showing that recursive languages are closed under union using a constructive argument with deterministic Turing machines? (In other words, how would you build a TM that would...

How would you go about showing that recursive languages are closed under union using a constructive argument with deterministic Turing machines? (In other words, how would you build a TM that would accept the union of the languages accepted by two other TMs?)