Considering the following network. With the indicated link cost, use Dijkstra's shortest path algorithm to compute the shortest paths from node V to all other nodes. You need to show how the algorithm works by computing a table.

2 3 3 7 4. 8 3 6 6 8