Question $6$

$0$

Question $6)(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, l$.$e$.,$ arrange the columns in the order $L,u_1,v_1,,$ and $y$ from left to right. When you encounter ties in executing the algorithm. please break the ties in favor of the leftmost column.