Consider the five node network shown below, with the given link costs. Using Dijkstras algorithm, find the least cost path from source node u to all other destinations. To receive credit, show your work in tabular format, as we did in class, with one line per step. If two nodes' path costs are tied, break the tie by choosing the node that comes first in the alphabet.