Consider an undirected graph G=(V,E) with nonnegative edge weights w(u,v)0. Suppose that you have computed a minimum spanning tree G, and that you have also computed shortest paths to all vertices from vertex sV. Now suppose each edge weight is increased by 1: the new weights w(u,v) = w(u,v) + 1. (a) Does the minimum spanning tree change? Give an example where they change or provide a proof showing they cannot change.(b) Do the shortest paths change? Give an example where they change or provide a proof showing they cannot change. explain the process to get to the on how to get the correct answer