algorithm

4. (10 points) A greedy algorithm for the Vertex Cover problem works as follows: Always move a vertex with the highest degree into the vertex cover, and then delete all edges incident to this vertex in the graph. Repeat the above operation until no more edges in the graph. Please provide a counter example to that this algorithm is not a 2- approximation algorithm for the Vertex Cover problem 4. (10 points) A greedy algorithm for the Vertex Cover problem works as follows: Always move a vertex with the highest degree into the vertex cover, and then delete all edges incident to this vertex in the graph. Repeat the above operation until no more edges in the graph. Please provide a counter example to that this algorithm is not a 2- approximation algorithm for the Vertex Cover