Consider the Dijkstra algorithm provided. After it is done, you have the array p[ ] of previous nodes. Write an algorithm that given a target vertex A, and this array p[ ] as the input, prints out the shortest path from source S to A. Try your algorithm for the example provided for target node x.

for each in v sm DIJK TRA ALGORITHM (GSVE>, W,s) { v=n { TEI= d[u] P[ue] = NULL } d[53-0 Make-heap (add all vertices & dli] in to a priority queue) for i=o to vi-l { for each yo Adjecency list n times x