\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)
A city council plans to build bike lanes connecting four parks: Green Park (\(G\)), Central Park (\(C\)), Riverside Park (\(R\)), and Hilltop Park (\(H\)). The costs (in thousands of euros) to build lanes between these parks are given in the weighted graph below.
The council wants to connect all parks with the minimum total cost.
  1. List the edges in ascending order of weight.
  2. Determine the edges that form the Minimum Spanning Tree (MST).
  3. Calculate the minimum cost to connect all the parks.

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