📝 **Question:** Implement `bellman_ford(n, edges, src)` returning a list of shortest distances. `edges` is a list of `(u, v, w)` tuples. Run on n=4, edges=[(0,1,1),(1,2,-2),(0,2,4),(2,3,3)] from 0. 📋 Pick the right answer. 💡 **Hint:** Re-read the theory above if unsure.