I need help to solve the following question: Write a simple algorithm which gets a simple Connectivity undirected graph to find the order of deletion on top, so that at no stage the Connectivity of the graph is not dropped. Formally: given graph G = (V, E) and a group of vertices, V*, the graph obtained from deleting V* from G is V*= (V-V*,E*), so that E*= ((u,w) belong to E | u, w no belong to V*). We are interested in arranging v1, ..., vn of the vertices, So that for each i we will get that: G-(v1 ,..., vi) is conectivity graph