Please make a table for Dijkstra's Shortest Path. Please provide steps/explanations for answers.

Show the result of each iteration of applying Dijkstras Shortest-Path Algorithm to the following graph, starting at node #1:

At each iteration, if a node has not yet been seen, then put an ? in the box for that node. After a node has been chosen, put an x in the box for the node. If there is a tie at a particular iteration, then pick the node having the lowest node number.

The table should look like this: