Quiz: Bounded Relaxation

You are solving "cheapest flights within $k$ stops" using Bellman-Ford. You run $k+1$ iterations but forget to copy the distance array before each iteration. What goes wrong?

1. A.The algorithm becomes slower than $O(V \cdot E)$
2. B.The algorithm detects a false negative cycle
3. C.Nothing goes wrong. The copy is an unnecessary optimization
4. D.You might use paths with more than $k$ stops because updates within one iteration chain together