Question 5: NP-Hardness - Baseball Card Collector Problem (15 pts) The Baseball Card Collector is as follows. Give a set of m packets P1, P2- Pm. each of which contains a subset of this year's baseball cards, is it possible to collect all of this year's cards by buying s k packets? For example, if the players are (Aaron Mays,Ruth,Steven) and the packets are {lAaron Mays}, {Mays Ruth), {Steven),{Mays.Steven), there does not exist a solution for k-2, but there does for h=3, such as (daron-Mavs},{lays Ruth. (Steven} Prove that the baseball card collector problem is NP-hard. Hint: which be reduced to this problem? well-known NP-hard problem can