Using Dijkstra's algorithm, and showing your work using a table Compute the shortest path from to all network med Dijkstra's Algorithm Initialization 7 M ). 3 for all nodes v If adjacent to 5 Then D() : cu) 6 else D = Infinite 8 Loop 9 Find x not in N such that D() is a minimum 10 Add x to N 11 update D(V) for all vadjacent to x and not in N 12 D(V) - min D(v). D(x) .cx)) 15 until all nodes in N E Notation: j): link cost from node i to j: set to i to j: oo if a I and j are not direct neighbors O D(V): = clifl current value of cost of path from source to destination v O P(V): previous node (neighbor of v) along the current least-cost path from source to v O N': subset of nodes; vis in N'; set of nodes whose least cost path is definitively known Step N D(V).p() D(w).p(w) D(x)p(x) DCY).py) D(z).p(z)