A$)$ Find the shortest path from $A$ to $F$ in this graph $(5$ points$)$

$($Answers should be like "ABCDE" in right order$)$

B$)$ When we are running Dijkstra's algorithm on this graph, after we visited A and examine its neighbors, the output Table will be like this and the visited and unvisited set will be

Visited $=\{A\},$ Unvisited $=\{B,C,D,E,F\}.$

Then we visit $E$ and change the numbers in the column and Visited $=\{A,B\},$ Unvisited $=\{E,C,D,F\}.$

Then we visit $E$ and change the Table. At this time Visited $=\{A,E,B\},$ Unvisited $=\{C,D,F\}.$

Finish this table after we finish running Dijkstra's algorithm and check if the result is the same as you calculated before $(10$ Points$)$