Question 4 [25 points]. An independent set XV of a graph G=(V,E) is a set of vertices such that there are no edges between any of the vertices in X. In the maximum independent set problem, you are given a graph G and the goal is to find an independent set of maximum size. Reduce the minimum vertex cover problem to the maximum independent set