^{you need to write the solutions in python and provide a brief explanation of your codes and the efficiency analysis with comments.}

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

.

input1 - Not Defteri Dosya Dzenle Grnm 010000010101000010010101001001011000000101000001110100000001001110000001001000110 \# output1 - Not Defteri Dosya Dzenle Grnm j input2 - Not Defteri 0010100000010010100001010100000010000000001000100100010000100000 output2 - Not Defteri Dosya Dzenle Grnm