Use the Bellman-Ford algorithm to find the set of shortest p…
Use the Bellman-Ford algorithm to find the set of shortest paths to destination node C. Provide the table showing each iteration of the algorithm. Begin with initial conditions for Iteration 0 (row 0). Stop when you reach a stable route, meaning when the last row repeats the previous row. The last two rows of your table should be identical, except for the iteration number. Answer format:Choose “Table” in the question editing menu and enter the table values accordingly. Except for the first column (Iteration), each entry should have the format (Next node, Cost). There should not be any blank entries.