(urgent)

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 1 0 0 0 0 0 1 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 0 0 1 0 0 1 0 1 1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 1 1 1 0 1 0 0 0 0 0 0 0 1 0 0 1 1 1 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0

Sample output:

0 1 2 3 4 5 6 7 8

2. Given a weighted undirected graph G where all the weights are fixed as 1 , devise an algorithm that outputs a minimum spanning tree of G. Since all the weights are just 1 , the algorithm is assumed to take an nxn adjacency matrix as input. The running time of your algorithm should be better than the running time of Kruskal and Prim