Question 4 Apply Dijkstra algorithm to complete the distance and predecessor tables at node C Not yet answered Marked out of 10.00 Flag question 1 E 2 2 1 3 1 B 4 Note: As long as the solution is valid for an iteration, you should copy it to the following iterations (don't leave any empty cell) 1 B 4 Note: As long as the solution is valid for an iteration, you should copy it to the following iterations (don't leave any empty cell) Iteration Newly added node to N'D(A) D(B) D(D) D(E) P(A) P(B) P(D) P(E) 0 1 2 3 4