Q. How many steps are required to prove that a decision problem is NP complete?
✅ Correct Answer: (B)
2
Explanation: first, the problem should be np. next, it should be proved that every problem in np is reducible to the problem in question in polynomial time.