Run the Bellman-Ford algorithm to find the shortest path (using each arc at most once) from node 1 to node 5. Show all of your work, and be sure to clearly show the progress of the algorithm at each intermediate iteration. Activate Wi Use the Bellman-Ford algorithm to answer the following question: does the st digraph have any negative-cost cycles? Justify your answer. 1 2 5 11 13 29 -17 3 9 Figure 1: Digraph 5 15 4