Problem 2. Apply Dijkstra's 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. 2 1 4 4 Iteration (2) Path L(3) Path |L(4) Path L(5) Path |L(6) Path 2 4 6 1,2, 5, 3,4 6 1-23 1-2-5-33 1-2-5-42 1-2-5 1-2-5-3-6