provide a briet explanation of PYTHON codes and the efficiency analvsis with comments. Either copying other solution or solving other language I'm gonna give dislike thx (PLS CHECK IF OUTPUT DETERMINE)

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 nn adjacency matrix as input. The running time of your algorithm should be better than the running time of Kruskal and Prim