Algorithm

Please answer right and clearly,

Thanks

Consider the following weighted undirected graph G: Although the "Minimal Spanning Tree Problem" is legitimately characterized as a "graph-related" problem, and the algorithm we discussed in class for solving it is legitimately characterized as a "graph algorithm, " that algorithm is also legitimately characterized as a "greedy algorithm" (since it always chooses to add the edge with the smallest weight among the set of currently available edges at each step-the "greedy" choice). So, now that we're studying "greedy algorithms, " let's revisit the minimum spanning tree algorithm from Topic #4. Use the greedy algorithm discussed in class at the end of Topic #4 to find a minimal-weight spanning tree for the graph G above. Indicate your answer by darkening/emboldening all, and only, those edges in the above graph that comprise that minimal-weight spanning tree