Code must be written in C Language/ UBUNTU environment.

To get full credit for each question, you need to provide a brief explanation of your codes and the efficiency analysis with comments.

3. 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. Also, all the inputs given to the algorithm are assumed to be legitimate, i.e. the users are assumed to provide only nxn matrices that consist of only Os and 1s as inputs