Find a minimum cost spanning tree in the graph below using Kruskal's Algorithm. (a) List the edges as a comma separated list in the order they are added to the tree. You may list an edge as a pair of...

Find a minimum cost spanning tree in the graph below using Kruskal’s Algorithm.

(a) List the edges as a comma separated list in the order they are added to the tree. You may list an edge as a pair of vertices like v1v3.

(b) List the edges that are consider for addition to the tree but are rejected. (c) List the edges that are not considered for addition (nor added to the tree).

Extracted text: Find a minimum cost spanning tree in the graph below using Kruskal's Algorithm. (a) List the edges as a comma separated list in the order they are added to the tree. You may list an edge as a pair of vertices like viv3. (b) List the edges that are consider for addition to the tree but are rejected. (c) List the edges that are not considered for addition (nor added to the tree). 1. 3 12 2 15 10 U2 13 14 9. 6. U3 11