Can i get some help

1. Consider the following weighted graph: 3 10 E G A B C 1 F Use Prim's algorithm to nd a minimal spanning tree. 2. Consider the following naive implementation of Kruskal's algorithm: Algorithm 1: Variant of Kruskal's Data: A weighted graph G = (V, E,w} Result: A minimal spanning tree T = (V, E',w') 1 Sort all the edges in E in increasing order of cost and label so that 31 has the smallest weight, 2 the second smallest and so on; 2 Initialize the edges in the minimal spanning tree E' = (; 3 for: 1:|E| do 4 if E' U{c,;} has no cycles then 5 \\ Add 3,; to T, that is E' = 13' meg}; 3 end 7 and Use this 1variant of Krushal's algorithm to compute a minimal spanning tree for the graph in problem (1)- 3. Do these algorithms construct the same minimal spanning trees