Dijkstra's Link$-$State Algorithm

Consider the following network. 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 the distance from $x$ to all network nodes.

Notes :

When the distance is infinity, write in the abbreviation "inf".

When there is a tie in node distances, please choose from left to right, i$.$e$.$ the node in the left column is chosen first.