The baseball card collector problem is as follows: Given packets P1, P2, ... , PM, eachof which contains a subset of the years baseball cards, and an integer K, is it possibleto collect all the baseball cards by choosing K packets? Show that the baseballcard collector problem is NP-complete.

Step 1 of 2

A problem is NP-Complete, when:

1. The problem is NP: That is when a token of solution is provided; the solution can be verified in polynomial problems.

2. The problem is NP hard: Any known NP hard problem can be reduced to this problem,