A 2-Tape Turing Machine ___________________.

• can infer that recursive languages are closed under union
• can show that recursive languages are closed under union Correct
• has two outputs
• has two inputs