(Shortest Paths) Consider the following weighted directed graph. Note that it does not contain negative-weight cycles. a. Run the Bellman-Ford algorithm to compute the shortest path distances from 1 to all other nodes. Give the state of the array d[17] after each iteration. b. Since this graph contains edges of negative weight, we do not expect Dijkstra's algorithm to work. Nevertheless, run Dijkstra's algorithm on this graph from node 1. Give the state of the array d[1..7] after each iteration. Compare the result to the output of Bellman-Ford's algorithm, and convince yourself that the output is indeed wrong. (Shortest Paths) Consider the following weighted directed graph. Note that it does not contain negative-weight cycles. a. Run the Bellman-Ford algorithm to compute the shortest path distances from 1 to all other nodes. Give the state of the array d[17] after each iteration. b. Since this graph contains edges of negative weight, we do not expect Dijkstra's algorithm to work. Nevertheless, run Dijkstra's algorithm on this graph from node 1. Give the state of the array d[1..7] after each iteration. Compare the result to the output of Bellman-Ford's algorithm, and convince yourself that the output is indeed wrong