b) Now modify the Dijkstras so that it finds not only shortest paths, but also the compute the length of shortest paths and store them in a suitable data structure. Your data structure should return the shortest path distance from the source to any given node in O(1) time.

DUKSTRA(G, w, s) //G: directed with nonnegative edge weights INIT-SINGLE-SOURCE(G, s) Q=G.V // Q is a priority queue which we // initialize with all the nodes in VIG] while Q is not empty do u EXTRACT-MIN(a) for each v e Adj[u] do RELAX(u, v, w