8 9 2 3 1 4 2 Apply Dijkstra's least-cost or shorted-path algorithm to N2 of the above network. Complete the table below by filing (alto) to show the result of all iterations. 3 P " H . " H . M " 45 F " FILL MY RELE 1 BELLE When completed, (al- . 00- -10 write like 2-5-3 with no spaces for full credits. 19 .0) and kl For a path, you must Question 3 8 9 2 N6 2 3 1 1 4 N4 N5 Apply Dijkstra's least-cost or shorted-path algorithm to N: filling (a) to (i) to show the result of all iterations. Iteration T (1) Path (3) Path L(4) Path (5) Path L Path 1 (2) 2-1 (d) (e) 2 (2,5) B 2-1 2-5-3 38 00 the 2-5 00 2 2-5 10 B 3 (2,5,()) B 2-1 $ 2-5-3 6 2-54 2 2-5 3 2-5-6 4 (2,3,5,6) B 2-1 s (2,3,4,5,6) (b) 55 2-5-3 " 254 2 2-5 3 2-5-6 2-5-3 6 2-54 6 (1,2,3,4,5,6) 7 2-5-4-1 5 2-5-3 . 2-54 NN 2 25 3 2-5-6 2 2-5 3 2-5-6 When completed, (a) = , (b): =