Show that Vertex cover of an undirected graph G = (V,E) is a subset V' CV such that if (u, v) e E then u e V' or ve V' or both (there is a vertex in V" "covering" every edge in E) and optimization version of the Vertex Cover Problem is to find a vertex cover of minimum size in G. Write algorithm for approximation vertex cover and give example.