(Choose 1 answer)
Given a weighted graph below and you are using the Dijkstra algorithm to find the shortest path from the vertex A to the vertex F. What are the correct order of vertices selected into the set S until the vertex F is selected? (Each step a vertex with minimal current distance is selected into S).
A. A, C, D, F
9
10
15
B. A. C. E. F
C. A, B, C, E, F
D. A, B, C, E, D, F
F
11
6
2
14
6
7
Exit 4
