13. Given the undirected graph, find the minimum spanning trees using the
specified algorithm. Break ties alphabetically. In each case, label the edges a,
b, c, d, e, and f in the order of the addition of the edges to the MST. Also,
determine the total weight of the MST.
U
A
2
5
4
4
3
8
2
7
S
B
C
6
9
1
6
3
8
T
D
a. Using Kruskal's algorithm;
b. Using Prim's algorithm starting with vertex A; and
c. Using Prim's algorithm starting with vertex S.
