2 Let G Undirected Connected Graph Edge U V Positive Weight W U V O Let S T Two Vertices G Q37029775

2. Let G be an undirected connected graph, and each edge (u, v) has a positive weight w(u, v) > O. Let s and t be two vertices of G. Let π(s,t) denote a shortest path from s to t in G. Let T be a inimum spanning tree of G. Please answer the following questions and explain why you obtain your answers. (a) Suppose we increase the weight

OR

 

OR