State true or false?
(a) Statement: If a problem X is in NP and a polynomial time algorithm for X could also be used to solve problem Y in polynomial time, then Y is also in NP.
(b) true
(c) false
This question was addressed to me in an interview.
Question is taken from Non Deterministic Polynomial Time topic in portion Intractable Problems of Automata Theory