18 3 14 2 5 8 2 2 Suppose we run Dijkstra's shortest-path algorithm on the above weighted 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 is found? Note, start your answer with A and put a single space between each vertex. Your answer should be in all capital letters. Dijkstra's shortest-path algorithm finds the shortest path from a source node to all nodes in the graph