1) True, for every Non deterministic Turing machine, there exist an equivalent deterministic Turing machine
2) False, Turing Recognizable languages i.e Recursive enumerable languages are closed under union but not under complementation.
3) True, Turing decidable language i.e Recursive languages are closed under intersection as well as complementation.
4) True, Turing Recognizable languages i.e Recursive enumerable languages are closed under union and intersection.
So, only 2 is false, option c is correct.