2. Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from v to all network nodes. Show how the algorithm works by computing a table similar to Table 5.1 (in the 7th edition of the textbook; if you are using the 6th edition, that is Table 4.3) 12 8 6 4 2 4 6