) Thus the class of NP-complete problems contains the most difficult problems in NP, in the sense that they are the ones most likely not to be in P.
The hardest problems in NP can be analogously written as what class of problems?
NP-complete