Problem $2.$

Consider the following undirected, weighted graph. Step through Dijkstra's

algorithm to calculate the single$-$source shortest paths from A to every other

vertex. Show your steps in a table$-$based structure, and list the vertices in the

order which you marked them known in set S$.$ Finally, indicate the best lowest$-$

weight path from node A to all other nodes.

You must provide a table that is similar the one given the slides: Diktra $-$

Shortest path $($from page $1$ to $5).$ppt$),$ provide one table only and show the steps

by crossing the previous value and add the new value, in the distance, previous

vertex and know columns.

Problem $3.$

Modify given Dijkstra Algorithm program in class to run graph data from

Problem $2$:

A$)$ Update input to the program to represent graph from Problem $2\_\_$

B$)$ Update program to print set S to the program console;

C$)$ Receive final output from the program and compare it with your manual

solution.

D$)$ Submit code and program output.

Based on Problem $2,$ I need the complete, detailed answer of Problem $3.$