please fill out chart

2. Shortest Path Problem (Dijkstra's Algorithm) (5.5 pts. total for Accuracy) Use Dijkstra's algorithm to find the shortest path from node A (Origin) to all other nodes. Show your work clearly through the 9 iterations necessary ( 0.5 pts. for each iteration) to complete the network and fill in the results table ( 1pt) presented below the network graphic. Iterations that can be used is provided below the table, the first network below is used only as an introduction