SINDHU, we need to change this question so that students ent…
SINDHU, we need to change this question so that students enter the value one at a time, as we discussed. Do you remember what needs to be done? We have run the first three iterations of the outer for-loop in the Bellman-Ford shortest-path dynamic programming algorithm for i=1,2,3 on the graph G below, obtaining the configuration of the Bellman-Ford dynamic programming matrix shown below. Run two more iterations of the outer for-loop in the Bellman-Ford algorithm for i = 4, 5, and answer the following question: For each option below, choose the value corresponding to the values of column 5 of the matrix at the end of the execution of the Bellman-Ford algorithm on G. T: A: B: C: D: E: