Multiple choice Assuming P$\ne$NP, which of the following is TRUE? NP-complete = NP NP-complete $\cap$P = $\phi$ NP-hard = NP 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.