Please fill the following table. Consider the network shown in the figure below. With the indicated link costs, use Dijkstras shortest-path algorithm to compute the shortest path from node v to all network nodes. Show how the algorithm works by presenting your results in the table provided.

Completely answer the following question. 1. Consider the network shown in the figure below. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from node v to all network nodes. Show how the algorithm works by presenting your results in the table provided. (10 points)