(Choose 1 answer)
Given a weighted graph below and you are using the Dijkstra algorithm to find the shortest path from the vertex B 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. B, C, D. F
2
3
12
B. B. C. F
C. B, C, E, F
D. B, C, D, E, F
4
12
22
8
F
6
23
