Exercise 3 (2 pts). The SPARSE SUBGRAPH problem is defined as follows: Input: (G, G is a graph and p,qE Z . Question: Does G have p vertices such that there are at most q edges between them? P,9) where l by giving a polynomial-time reduction of (known to be NP-hard) to SPARSE SUBGRAPH. Hint. Any independent set of size k can be viewed as a "sparse subgraph" consisting of k vertices with no edges between them