title: Question about nSudoku if we assume that it is NP-complete
body: <p>Explain why each of the following statements is correct. You may assume that nSudoku is NP-complete.
  If nSudoku can be reduced in polynomial time to factorization, then factorization is NP-complete.
  If nSudoku can be reduced in polynomial time to the problem of sorting an integer array, then P = NP.
  Any ideas how to explain? Thank you!!!</p>