Minimum Spanning Trees and Shortest Distances Consider an undirected graph G = (V, E) with nonnegative weights w(i, j)20 on its edges (i, j) E E. Let s be a node in G. Assume you have computed the shortest paths from s, and minimum spanning tree of the graph. Suppose we change the weights on every edge by adding 1 to each of them. The new weights are w 0 (i,j) (i, j) + 1 for every (i,j) E E. (a) Would the minimum spanning tree change due to the change in weights? Give an example where it changes or prove that it cannot change. (b) Would the shortest paths change due to the change in weights? Give an example where it changes or prove that it cannot change