Option 1. Consider an undirected graph which is formed by taking a binary tree and adding an edge from exactly one of the leaves to another node in the tree. We call such a graph a loop graph. An example of a loop graph could be the following one: Assume you are given a weighted loop graph (each edge has a positive integer weight). Design an efficient algorithm (better than Kruskal and Prim) for finding the minimum spanning tree of the given graph. To get full credit, you need to argue the running time