Problem
Consider an example of a shortest path problem with four nodes and two negative arc lengths, but no negative loops, which Dijkstra's algorithm will solve correctly. Construct another example with four nodes that Dijkstra's algorithm will solve incorrectly. (Remember to draw the nets and explain your answer clearly for both of your examples)