\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)
Consider the weighted graph below:
  1. List the edges in ascending order of weight.
  2. Using Kruskal's algorithm or Prim's algorithm, find the total weight of the Minimum Spanning Tree (MST).

Capture an image of your work. AI teacher feedback takes approximately 10 seconds.