5. Execute the Dijkstra Algorithm on Router u to find out the shortest paths from Router u to all other routers. Specifically, please complete the table below according to the algorithm operations, as we did in class. 9 5 7 3 3 8 W Z 2 3 7 S D(v), P(v) D(w), P(w) D(x), P(x) D(y), ply) D(z), P(z) Step 0 (init.) 1 2 3 4 5 notation: D(v): current value of the cost of path from source to destination nodev P(v): predecessor node along the path from source to destination nodev S: the done set, i.e., the set of nodes for which the least cost paths have been discovered