Which of the following statements are TRUE about an NP‑Hard problem? Select all that apply.  多项选择题

It must be NP‑Complete

It is at least as difficult as the most difficult problems in NP

It is solvable in polynomial time on a deterministic computer

It need not be NP‑Complete

It need not be in NP

All problems in NP are more difficult than it

It is always verifiable in polynomial time on a deterministic computer

It can be reduced to NP‑Complete problems

Every problem in NP can be reduced to it in polynomial time

All of the other choices