5) (21 points) Consider the network shown in the figure below. Use Dijkstra's shortest- path algorithm to compute the shortest paths from node w to all other network nodes Show how the algorithm works by using the table format used in class. In the table please assign the nodes to the columns in alphabetical order, i.e., arrange the columns in the order t, u, v, x, and y from left to right. When you encounter ties in executing the algorithm, please break the ties in favor of the leftmost column 98 6 0 8 2 3