(55) Which of the following statements is wrong? (A) A problem is NP-complete, if it belongs to the class NP and all the other members in NP can be reduced to it in polynomial time. (B) Problem I belongs to NP. (C) Problem III belongs to NP. (D) Problem III is NP-complete. (E) If we change the graph in Problem IlI to directed graph, then it belongs to P.