Let G(V,E) be a weighted graph represented using adjacency-list graph representation. We run the Prim's algorithm from an arbitrary vertex to build a MST. Write the pseudocode of an algorithm which for every vertex prints the weight of the path from r to v in the MST. What is the running time of your algorithm?

ALGORITHM(G,w)

let r be an arbitrary vertex in G.V

MST-PRIM(G,w,r)

// add your pseudocode here