provide a briet explanation of PYTHON codes and the

efficiency analvsis with comments. Dont copy other solutions and dont solve other language just need PYTHON. thx (DETERMINE THE I/O)

Consider a loop tree which is an undirected wighted graph formed by taking a binary tree and adding an edge from exactly one of the leaves to another node in the tree as follows: Let n be the number of vertices in a loop tree. How long does it take Prim's or Kruskal's algorithms to find the minimum spanning tree in terms of n ? Devise a more efficient algorithm that takes an nxn adjacency weighted matrix as input, and finds the minimum spanning tree of a loop tree