need help this question

Problem 1: We have seen Kruskal's Algorithm and Prim's Algorithm, two greedy algorithms for building minimum spanning trees. Both of these al- gorithms begin with zero edges, and then add edges in a specific order one at a time until a spanning tree is created. One can also create a minimum spanning tree by removing edges one at a time, in a greedy manner, from the input graph G. Describe, with sufficient detail for me to implement it, a greedy algorithm that follows this process