Let be an edge-weighted undirected graph with positive edge weights. Suppose a positive constant is added to the weight of every edge.
Which ONE of the following statements is TRUE about the minimum spanning trees (MSTs) and shortest paths (SPs) in before and after the edge weight update?
- AEvery MST remains an MST, and every SP remains an SP.
- BMSTs need not remain MSTs, and every SP remains an SP.
- CEvery MST remains an MST, and SPs need not remain SPs.
- DMSTs need not remain MSTs, and SPs need not remain SPs.

