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 y to all network nodes. Show how

the algorithm works by presenting your results in the table provided.