Consider a shortest path problem on a given network. Assume a shortest path from node s to node d has been found. Discuss how the shortest path and shortest path cost may change for each of the following scenarios.

1. All arc costs C_ij becomes 5C_ij.
2. All arc costs C_ij becomes 10+C_ij.
3. One specific arc (i,j), which is on the shortest path, the cost becomes 10+C_ij.