Problem E: In class we stated that Dijkstra's algorithm may give a wrong shortest path from a node s to a node d if one or more of the edges has a negative cost. (i) Draw one such example. Make sure...

Please please answer all three subparts

Thanks

Extracted text: Problem E: In class we stated that Dijkstra's algorithm may give a wrong shortest path from a node s to a node d if one or more of the edges has a negative cost. (i) Draw one such example. Make sure to clearly show the costs on each edge. (ii) Draw the correct shortest path from s to d. (iii) Draw the path (from s to d) that would be obtained using Dijkstra's algorithm