For the below graph, write down the edges as they are added to the spanning tree by Kruskal's algorithm as well as Prim's algorithm. For Prim's algorithm, choose 0 as the starting vertex.
Since the weight of the edges is distinct, please use it to denote the edge in your answer (i.e. instead of (0,3) to denote the edge between vertices 0 and 3, use just 8 which is the weight of the edge .
0
ap
3
10
12
4
11
2
5
3
10
6
1
5
14
6
13
9
11
8