1. Consider the following undireeted, weighted graph: 12 3 10 Step through Dijkstra’s algorithun to caleulate the single- souree shortest pathas from A to every other your stops in the table below. Cross out old values and write in new oncs, from left to within each cell, as the algorithm proceeds. Also list the verticos in the ortler which you marked vertex. Show your steps in the table below. Cross out old valucs and write in new them known.
OR
OR