How you prove a problem Q is NP-complete.
2. Select a known NP-complete problem R.
3. Describe a polynomial time computable algorithm that computes a function f mapping every instance of R to some instance of Q.
4. Prove that for every yes-instance of R maps to a yes-instance of Q, and every no-instance of R maps to a no-instance of Q.