(15 points) We are given an undirected graph G (V,E) as an input, and our goal is to find the minimum of vertices whose deletion will remove all the edges in G (when we delete a vertex, the exdges inecident to it will be remove long greedy algorithm optimal? While there are still edges left: pick a vertex with current maximum degree and remove it. e endwhile