6. (30) For the graph given below, write down the sequence of edges that Kruskal'$, Prim s and the reverse-delete algorithm would add in order to build the minimum spanning tree. For Prim'$, assume the starting node is node 2. You can use eij to denote the edge between vertices i and j For example, the edge between vertices 1 and 2 with weight 8 is written a8 e12.
8
2
3
11
8
14
4
10
5
