2. (6 points) Consider an undirected graph G-(V,E) with nonnegative edge weights w(u,v)20. Suppose that you have computed a minimum spanning tree G, and that you have also computed shortest paths to all vertices from vertex seV. Now suppose each edge weight is increased by 1: the new weights w'(u,v) = w(u,v) + 1. a Does the minimum sne changer Cil Chansge (b) Do the shortest paths change? Give an example where they change or prove they cannot change