Consider the following network. With the indicated link costs, use Dijkstra's shortest$-$path algorithm to

compute the shortest path from node $x,$ node $t,$ and node $z$ to all network nodes, seperately. Show how

the algorithm works by computing the necessary tables.