Question 7: Approximation Algorithm for Vertex Cover Given a G = (V, E), find a minimum subset C V, such that C "covers" all edges in E, i.e., every edge Eis incident to at least one vertex in C. Figure 1: An instance of Vertex Cover problem. An optimal vertex cover is (b, c, e, , g Algorithm 1: APPROX-VERTEX-COVER(G) 2 while E pick any fu.v)EE delete all eges incident to either u or v return C Prove that Algorithm 1 above is a 2-approximation algorithm (15 pts)