Dijkstras single source shortest path algorithm when run from vertex a in the below graph, in what order do the nodes get included into the set of vertices for which the shortest path distances are finalized

c. Dijkstra's single source shortest path algorithm when run from vertex a in the below graph, in what order do lhe nodes get included into the set of vertices for which the shortest path distances arc finalized pints