Problem 1: We have seen Kruskal's Algorithm and Prim's Algorithm, two greedy algorithms for building minimum spanning trees. Both of these algo- rithms begin with zero edges, and then add edges in a speci c 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. In other words, your initial edgeset should contain all edges in G, and you should greedily remove edges from this set until you are left with a minimum spanning tree. Describe this greedy algorithm in sucient detail for me to implement it.