Dijkstra’s single-source shortest path algorithm returns a results grid that contains the lengths of the shortest paths from a given vertex to the other vertices reachable from it. Develop a...

Dijkstra’s single-source shortest path algorithm returns a results grid that contains the lengths of the shortest paths from a given vertex to the other vertices reachable from it. Develop a pseudocode algorithm that uses the results grid to build and return the actual path, as a list of vertices, from the source vertex to a given vertex. (Hint: This algorithm starts with a given vertex in the grid’s first column and gathers ancestor vertices, until the source vertex is reached.)