Prove that the following CARD-TRADING problem is NP-Complete. (Hint: use the known NPComplete SUBSET-SUM problem for reduction.)

Prove that the following CARD-TRADING problem is NP-Complete. (Hint: use the known NP- Complete SUBSET-SUM problem for reduction.) CARD-TRADING: You have a deck D of Pokemon cards. Each card has a monetary value and D has a total value of x. Now you want to use some of the cards, which we call D', to trade with your friend where D' should have a total value of Can you find such a D'? SUBSET-SUM: Given a set S of positive integers and an integer k, is there a subset of S whose numbers sum to k