(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).
3
6
5
3
5
5
1
4
F
A. A. D. F
B. A, B, C, D. F
C. A, B, D, C, F
D. A, B, C, D, E, F
1
4
