Consider the network shown below $($note that edges are directed$).($Attached picture$)$

Calculate the shortest paths to all nodes from source node A using Dijkstra$$s algorithm. Record your solutions through the next few questions.

Note:

$-$ When choosing the node to explore next, if there is more than one node that has the shortest known path so far, choose the node which is alphabetically earlier first.

$-$ A few entries for Iteration $1($i$.$e$.,$ row $1)$ have already been filled in for you. Use a similar format for the remaining answers.

Iteration $1$

"Distance" means the shortest known distance from the source node A to this particular node.

"From" means the preceding node of this particular node in the shortest known distance path.

"Finalized?" means is the shortest distance path from the source node to this particular node finalized?

Node being explored: A

Was my Iteration $1$ correct? Can you help me with Iteration $2$ and $3?$

Iteration $2($Row $2)$

"Distance" means the shortest known distance from the source node A to this particular node.

"From" means the preceding node of this particular node in the shortest known distance path.

"Finalized?" means is the shortest distance path from the source node to this particular node finalized?

Node being explored:

Iteration $3($Row $3)$

"Distance" means the shortest known distance from the source node A to this particular node.

"From" means the preceding node of this particular node in the shortest known distance path.

"Finalized?" means is the shortest distance path from the source node to this particular node finalized?

$$

Node being explored: