70. Which one of the following descriptions of NP-Completeness is WRONG？ (A) An NP-Complete problem is also an NP-Hard problem. (B) Given an NP-Complete problem, the correctness of each solution can be verified in polynomial time. (C) An NP-Complete problem can be reducible to every problem in NP. (D) If an NP-Complete problem can be solved in polynomial time, it implies P=NP.