WHICH NP-COMPLETE PROBLEMS ARE NOT IMPOSSIBLE TO SOLVE WHICHONES WOULD POSE SIGN

WHICH NP-COMPLETE PROBLEMS ARE NOT IMPOSSIBLE TO SOLVE WHICHONES WOULD POSE SIGNIFICANT DIFFICULTIES? WHICH WOULD BE THE MOSTUSEFUL TO SOLVE? HOW WOULD YOU APPLY SUCH ALGORITHMS TO EVERYDAYPROBLEMS? DESCRIBE EACH PROBLEM