Multiple choice

Assuming P$\ne$NP, which of the following is TRUE?

  1. NP-complete = NP

  2. NP-complete $\cap$P = $\phi$
  3. NP-hard = NP

  4. P = NP-complete

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

If P! = NP, then it implies that no NP-Complete problem can be solved in polynomial time which implies that the set P and the set NPC are disjoint.