[Solved]1 20 Points Minimum Spanning Trees Roads Suppose Given Following Connected Undirected Weig Q37195066

1. (20 points) Minimum Spanning Trees in Roads. Suppose you are given the following connected, undirected, weighted graph where the vertices represent intersections in a city and the edges are the roads connecting these intersections. The weights on the edges represent the relative traffic congestion (the larger the weight, the more congested the road is) U4 02 12 10 07 13 4 14 0 01 (a) (10 points) The city planners want to find a tree that spans the intersections while having the minimum weight. Use Prim’s algorithm to determine this tree. Show all your work (b) (10 points) Is the minimum spanning tree for this graph unique? If not, show a another minimum spanning tree. If it is unique, prove it by contradiction (assume that it is not unique and show that this contradicts that the spanning tree you obtained in part (a) is minimal) Show transcribed image text 1. (20 points) Minimum Spanning Trees in Roads. Suppose you are given the following connected, undirected, weighted graph where the vertices represent intersections in a city and the edges are the roads connecting these intersections. The weights on the edges represent the relative traffic congestion (the larger the weight, the more congested the road is) U4 02 12 10 07 13 4 14 0 01
(a) (10 points) The city planners want to find a tree that spans the intersections while having the minimum weight. Use Prim’s algorithm to determine this tree. Show all your work (b) (10 points) Is the minimum spanning tree for this graph unique? If not, show a another minimum spanning tree. If it is unique, prove it by contradiction (assume that it is not unique and show that this contradicts that the spanning tree you obtained in part (a) is minimal)

Expert Answer

---

Answer to 1. (20 points) Minimum Spanning Trees in Roads. Suppose you are given the following connected, undirected, weighted grap… . . .