Consider a weighted undirected network with edge costs cij . We are given the network’s minimum spanning tree, and a shortest path between two nodes n1, n2. On the same network, the edge costs are now being replaced with c 0 ij = cij +d, where d is a constant value (e.g. d = 15). Can such a replacement result in any changes to:
1. The network’s minimum spanning tree.
2. The shortest path from n1 to n2. Credit will only be given to fully justified answers.