Quiz: Relaxation and Iterations

You have a graph with $6$ nodes. After running Bellman-Ford, you find that a distance value changes on the $6$th iteration. What does this tell you?

1. A.The shortest path has exactly $6$ edges
2. B.A negative-weight cycle is reachable from the source
3. C.The algorithm needs one more iteration to converge
4. D.The graph has exactly $6$ edges