A set of Pokemon cards consists of n different cards. The cards are sold as different sized randomly selected packs. Each pack is a subset of the set of Pokemon cards. There arem such packs. You happen to know which cards were placed in which packs. You want to select a minimum set of packs such that you will get at least one of every every card in the set. 1. Show this problem is in NP. 2. Give a verification algorithmfor this problem. 3. Prove your algorithm is correct. 4. The Vertex Cover problem is already known to be NP-complete. We can show that Pokemon is NP-complete by reducing Vertex Cover to Pokemon. a) Give a reduction from Vertex Cover to Pokemon. The reduction takes input to Vertex Cover and converts it into input to Pokemon. b) Prove your reduction is correct.