An undirected weighted graph G is given below: 11 3 1 -4.1 7 2 -2 .2 i -1 -1 .7 3 a b .5 (a) Use Prim's algorithm to compute the minimum spanning tree for the weighted graph. Start the algorithm at...

Extracted text: An undirected weighted graph G is given below: 11 3 1 -4.1 7 2 -2 .2 i -1 -1 .7 3 a b .5 (a) Use Prim's algorithm to compute the minimum spanning tree for the weighted graph. Start the algorithm at vertex a. Show the order in which the edges are added to the tree. (b) Now suppose that the weight of edge {e,f} is decreased from 7 to -3. Is there a way to find the minimum spanning tree of the altered graph without running Prim's algorithm from scratch?