Consider an undirected graph G (V,E) with nonnegative edge weights we 2 0. Suppose that you have computed a minimum spanning tree of G, and that you have also computed shortest paths to all nodes from a particular node s e v. Now suppose each edge weight is increased by 1. the new weig creased by 1. the new weights are we We + 1 Does the minimum spanning tree change? Give an example where it changes or show it cannot change. Do the shortest paths change? Give an example where they change or show they cannot change. a. b