(urgent)

please look at the question and don't copy from another question.

the code should be provided in python. preferable that the code can take different inputs. please use the sample input given and provide the output in the way given. please provide an explanation of your solution and efficiency analysis.

Sample input:

0 7 8 0 0 0 0 0 0 7 0 0 6 5 0 0 6 0 8 0 0 0 0 6 4 0 0 0 6 0 0 0 0 0 0 0 0 5 0 0 0 0 0 2 1 0 0 6 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 6 0 0 2 0 0 0 0 0 0 0 0 1 0 0 0 0

Sample output:

0 1 4 8 7 3 2 6 5

3. 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