1. //Initialise single source(G, s) 2. S=0 3. Q=V[G] 4. While Q != 0 Do u=extract- min(Q) 5. S=S union {u} For each vertex v in adj[u] 6. 7. 8. Do relax(u, v, w) 3. What happens when while loop in...

DO NOT COPY FROM OTHER WEBSITES (else answer will be reported to bartleby team)

Upvote guarenteed for a correct and detailed answer. Thank you!!!

Extracted text: 1. //Initialise single source(G, s) 2. S=0 3. Q=V[G] 4. While Q != 0 Do u=extract- min(Q) 5. S=S union {u} For each vertex v in adj[u] 6. 7. 8. Do relax(u, v, w) 3. What happens when while loop in line 4 is changed to while Q>1? There can be several Minimum costs of spanning tree in one graph While loop gets executed for v-1 times While loop gets executed only once While loop does not get executed