Problem 3. Repeat Problem 2 using the Bellman-Ford least-cost or shorted-path

algorithm to the same network (shown again on the right for your convenience).

Complete the table by filling the Lh(n) and Path on each row to show the result

of each iteration. Result of the last iteration with h = 4 is already provided in red

as a way to help you to verify if your iterations are performed correctly.

Problem 2. Apply Dijkstras least-cost or shorted-path algorithm to the network

shown on the right. Complete the table by filling the T, L(n), and Path on each row

to show the result of each iteration. Result of the last iteration, 6, is already

provided in red as a way to help you to verify if your iterations are performed

correctly.