Review a classmate's graph and address all of the following items completely.

1. Apply either Prim's algorithm or Kruskal's algorithm (not presented in the text so you would need to look this up elsewhere) to find a minimum spanning tree for your classmate's weighted graph. Explain the steps taken and present the minimum spanning tree with a visual.
2. In the context of your classmate's real-world context:
   • What is the total weight of this spanning tree?
   • What is the difference between your minimum spanning tree and your classmate's spanning tree (from their initial response)?
   • How can you interpret the total weight for this spanning tree within the real-world context?

ATTACHED IS AN EXAMPLE OF WHAT A FINISHED PRODUCT WOULD LIKE AND THE STUDENT I NEED IT DONE FOR AS WELL; THE STUDENT IS ON TOP AND THE EXAMPLE IS UNDER THAT; THANK YOU!

A E B 1 6 C N D In my weighted graph: A - Home B - Gas Station C - Work D - Sons School E - Grocery Store The weighted numbers are weighted from 1-6 in order of importance. For example, A (home) to D (Sons school is the highest importance) so it is weighted at 1. From my sons school (D) to the gas station (B), it's the least important of the all the points due to it is not always necessary. In a spanning tree, the graph would look like: E B C The weighted scale is (A.D. 1), {D.C. 2], {A,B, 4), {A,E,5) or 1+2+4+5 = 12 The weighted scale is {A.D. 1], {D.C. 2], [A,B, 4), {A,E,5) or 1+2+4+5 = 12Post 2: Reply to a Classmate 1) I will apply Kruskal's algorithm to my classmate's weighted graph. Iteration Number Edge Considered Weight Action Taken Cumulative Weight H - F 1 mile added 1 F - T 4 miles added 5 F - G 5 miles added 10 H - G 6 miles Not added, makes a 10 circuit G- L 12 miles added 22 T - D 14 miles added 36 F 4 miles 1 mile H T 5 miles 6 miles 22 miles G 14 miles 17 miles 12 miles 15 miles D The total weight of this spanning tree is 36 miles. It is slightly different than the spanning tree that my classmate presented. They connected H to G but I found that it was less distance by connecting F to G. (H is already connected to F.)