MST For the graph in Figure 1, write down the edges in the order as they are added to the spanning tree by Kruskals algorithm and Prims algorithm. For Prims 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).

Figure 1: Sample graph foe MST and Bicosaertod Compocrts