Problem
Consider the Pokemon problem from above. Now you will prove it is NP-hard by stating and proving correct your polynomial time reduction. The NP-complete problem you will use for your reduction is the Vertex Cover problem.
1. Give a reduction from Vertex Cover to Pokemon. The reduction takes input to Vertex Cover and converts it into input to Pokemon.
2. Prove your reduction is correct. Prove your reduction runs in polynomial time.