Q. Which of the following statement is false for a turing machine?

• (A) There exists an equivalent deterministic turing machine for every nondeterministic turing machine
• (B) Turing decidable languages are closed under intersection and complementation
• (C) Turing recognizable languages are closed under union and intersection
• (D) Turing recognizable languages are closed under union and complementation