3. (10 pts.) Dijkstra's on negative Consider the behavior of Dijkstra's Algorithm on directed graphs with negative edges. (a) Give an example where Dijkstra's does not produce the correct algorithm. Be sure to draw the directed graph with edge weights and identify the start vertex. Label each vertex with the distance produced by Dijkstra's as well as with the correct distance. (You can use drawing/handwriting for this answer) (b) Identify the part in the proof of Dijkstra's correctness (in the handout) which does not necessarily hold when the input graph contains negative edges. Elaborate why, in more detail then in the handout