Use Kruskal's and Prim's algorithms to calculate a minimum spanning tree of the following graph. Write down the edges of the MST in the order in which each algorithm adds them to the MST. Use the format (node1, node2) to denote an edge (i.e. (A,C) is an edge between nodes A and C).
11
20
13
15
14
10
1
4
12
B
25