Consider the graph given above. Use Kruskal's algorithm to find the minimum spanning tree.

a. What is the total weight of the spanning tree?

b. List the weights of the selected edges separated by commas in the order of selection.