For Prim's algorithm, show the edge selected at each iteration of the main while loopthe one added to the MST. For Prim, this edge is {u.pred, u}, i.e., the edge connecting u to some vertex in S. (When u = s in the first iteration, this edge wont exist; write None.)

// Prim's Algorithm on G=(V,E,w). // Initialization. for each vV do v.k v.pred None end for s.k S QV /Mainloop. while Q= do uQ. extract_min () SS{u} // Update neighbors' priorities. for each neighbor v of u with v/S do if w(u,v)