2. (12 points) Rewrite the pseudo code on slide 14 of Chapter 5 in the following way: Insert/update code as needed such that the predecessor node p(V) for each destination V is computed during the execution of the algorithm Add a new piece of code at the end of the algorithm that, for each of all of the destination nodes in the network, say V, finds out the complete path r(u, v) from u to V. Finally, it finds the first hop from u to v Note: pseudo code without proper indentation will receive a grade of0 Diisktra's algorithm 1 Initialization 3 for all nodes v 4if v adjacent to u 5then D(v)c(u,v) 6 else D(v)co 7 8 Loop 9 find w not in N' such that D(w) is a minimum 10 add w to N 11 update D(v) for all v adjacent to w and not in N' 12 D(v) = min( D(v), D(w) + c(w,v) ) 13 /* new cost to v is either old cost to v or known 14 shortest path cost to w plus cost from w to v / 15 until all nodes in N' Network Layer: Control Plane 14 2. (12 points) Rewrite the pseudo code on slide 14 of Chapter 5 in the following way: Insert/update code as needed such that the predecessor node p(V) for each destination V is computed during the execution of the algorithm Add a new piece of code at the end of the algorithm that, for each of all of the destination nodes in the network, say V, finds out the complete path r(u, v) from u to V. Finally, it finds the first hop from u to v Note: pseudo code without proper indentation will receive a grade of0 Diisktra's algorithm 1 Initialization 3 for all nodes v 4if v adjacent to u 5then D(v)c(u,v) 6 else D(v)co 7 8 Loop 9 find w not in N' such that D(w) is a minimum 10 add w to N 11 update D(v) for all v adjacent to w and not in N' 12 D(v) = min( D(v), D(w) + c(w,v) ) 13 /* new cost to v is either old cost to v or known 14 shortest path cost to w plus cost from w to v / 15 until all nodes in N' Network Layer: Control Plane 14