Please use an example to explain why Dijkstra's Algorithm may not work when there is negative weight edge, but Bellman Ford's Algorithm does. You need to implement the two algorithms and show all steps with your example.