Part a
Design a connected weighted graph to model an urban transportation network. Describe how you would apply a Minimum Spanning Tree (MST) algorithm (such as Kruskal’s or Prim’s) to ensure that all intersections are connected with the minimum total construction cost. Include details on how nodes and weighted edges are defined in your model.