A problem which is both _______ and _________ is said to be NP complete.
(a) NP, P
(b) NP, NP hard
(c) P, P complete
(d) None of the mentioned
I had been asked this question during an internship interview.
Question is taken from Non Deterministic Polynomial Time in portion Intractable Problems of Automata Theory