(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 C. What are the correct order of vertices selected into the set S until the vertex C is selected? (Each step a vertex with minimal current distance is selected into S).
A. A, B, D, C
B. A. B. E. C
C. A. B. C
D. A, B, D, E, C
2
10
20
5
4
1
1
F
10
Exit 36
