20. Dijkstra's algorithm for computing lowest-cost paths from a single source node is always correct 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: If running Dijkstra's algorithm with start node A produces the correct lowest-cost path to every other node, then say lcorrect." * Else list all nodes for which Dijkstra's algorithm produces the wrong path. For all such nodes, write the path Dijkstra's algorithm produces and write the correct lowest-cost path 3B-2 8 CT 4 21. Use Bellman-Ford algorithm 3 3