How many steps are required to prove that a decision problem is NP-complete?
1
2
3
4
(B) 2
Explanation:
Two steps: first, show the problem is in NP; second, prove that every NP problem is polynomially reducible to it.
