Computer network

3. Consider the following network fig 1. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to the table on slide 5-15. 12 8 7 6 8 12 3 6 w Fig 1