Suppose we run Dijkstras shortest-path algorithm on the following weighted, directed graph with vertex P 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 P and put a single space between each vertex. Your answer should be in all capital letters.