Vertex Cover of an undirected graph G=(V,E) is a subset VV such that if (u,v) E then uV or vV or both (there is a vertex in V "covering" every edge in E ). The optimization version of the Vertex Cover Problem is to find a vertex cover of minimum size in G. Write algorithm for approx vertex cover with example. Prove that Approx-Vertex-Cover is a polynomial time algorithm for Vertex Cover