Explain clearly how to do other sums like this too

Consider the following network. With the indicated link costs, we can use Dijkstra's shortest-path algorithm to compute the shortest path from v to all other network nodes. Instructions for completing the table: - In the N column, list the order in which nodes were visited, like this: xzy - In the remaining columns, write the distance and previous hop, separated by a comma, like: 2,x - If the distance is infinity, just write: inf - In case of a tie: if more than one node has the same (smallest) distance, use alphabetical order on node name to break the tie (smaller letter value wins). The first row is completed for you