What is the main statement of the Immerman–Szelepcsényi theorem in computational complexity theory?

A. Nondeterministic time complexity classes are closed under complementation
B. Deterministic space complexity classes are closed under complementation
C. Nondeterministic space complexity classes are closed under complementation
D. Deterministic time complexity classes are closed under complementation
Answer: 