Suppose we run Dijkstra's single-source shortest-path algorithm on the following weighted directed graph with vertex $a$ as the source. In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized?