To which of the following class does a CNF-satisfiability problem belong?
(a) NP class
(b) P class
(c) NP complete
(d) NP hard
I have been asked this question in an internship interview.
Question is taken from Checksum, Complexity Classes & NP Complete Problems topic in portion Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II