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