Q13-A-8 points Use Kruskal’s algorithm to find a minimum spa…
Q13-A-8 points Use Kruskal’s algorithm to find a minimum spanning tree for the following graph. Indicate the order in which edges are added to form the tree. (Enter your answer as a comma-separated list of sets.) The following matrix represents the weighted graph of this question: