DIJKSTRA (G, w, s)//G: directed with nonnegative edge weights INIT-SINGLE-SOURCE (G, s) S = phi Q = G.V//Q is a priority queue which we //initialize with all the nodes in V [G] while Q is not empty do u = EXTRACT-MIN (Q) S = S union {u} for each v element Adj [u] do RELAX (u, v, w a) Use the algorithm above to find the shortest path from vertex 5 to all other vertices in the graph given below as using adjacency matrix. First draw the graph for the given matrix and the show each step clearly in finding the shortest path. Value 0 indicate that there is no direct path