CS 3345: Data Structures and Algorithms - Homework 8 1. Dijkstra's algorithm for computing lowest-cost paths from a single source node is always correct r graphs without negative-cost edges. If a graph has negative-cost edges, the algorithm mighto a) If running Dijkstra's algorithm with start node A produces the correct lowest-cost path to b) Else list all nodes for which Dijkstra's algorithm produces the wrong path. For all such might not give the right answer. For each directed graph below every other node, then say lcorrect." nodes, write the path Dijkstra's algorithm produces and write the correct lowest-cost path. C -4