In the following step of the Dijkstra's algorithm (refer to unit 15, slide 9), find w not in N' such that D(w) is a minimum there may be a tie, and ties can be broken arbitrarily. In this assignment, to get consistent submission answers, if there is a tie, choose the node which comes first in alphabetical order. For example, if y, z and w are tied, choose w. Fill out the Dijkstra tables for the algorithms at node u and x (a table template is provided below), to answer the questions. What is the lowest cost path from u to z? (To answer the question, trace the predecessor nodes in the table at node u). To represent a path from a source to a destination, list all the nodes on the path, separated by - >. For example, u->w->v->t is a path from source u to destination t. Have no space between the - and >. In your answer, do not include any text or comment such as "The route is ", etc. The automated grader will not be able to recognize your answer as correct if you don't follow these rules. Iteration D(t), p(t) D(w), p(w) D(x), p(x) D(y), ply) D(2), p(z) N' D(v), p(v) 1 3 4 6. 12 8 7. 2 Figure 1