$2$:

What is the shortest path from Node A to Node F$?$

a$)A-B-D-F$

b$)A-C-B-E-F$

c$)A-F$

d$)A-C-E-F$

e$)A-B-E-F$

Using the graph from the previous question, if we apply Dijkstra's algorithm to find the shortest path distance

between node A to all other nodes, in what order do the nodes gets into to the visited list $[$i$.$e$.$ their distances

have been finalized$]?$

a$)B-C-G-F-D-E$

b$)C-B-G-F-G-D$

c$)B-C-E-F-D-G$

d$)B-C-G-E-F-G$

e$)B-C-E-F-G-D$