Using Prim's Algorithm, create a minimum spanning tree of the graph, starting from the node with value "S". Break ties alphabetically by name. Your graph is guaranteed to be connected.

Print the included edges as well as the total cost of the MST.

 

Provided Pseudocode: please implement using this

 

Transcribed Image Text:

(i) 11 h 8 7 14 10 MST-PRIM(G, w,r) 1 for each u G.V u.key = 2 3 u.= NIL 4 r.key = 0 5 Q = G.V 6 while Q +0 @ 7 u = EXTRACT-MIN(Q) 8 for each v G. Adj[u] 9 10 11 if ve Q and w(u, v) < v.key V. = U v.key = w(u, v) 8 + 7 2 (i) 11 h 8 7 14 10 MST-PRIM(G, w,r) 1 for each u G.V u.key = 2 3 u.= NIL 4 r.key = 0 5 Q = G.V 6 while Q +0 @ 7 u = EXTRACT-MIN(Q) 8 for each v G. Adj[u] 9 10 11 if ve Q and w(u, v) < v.key V. = U v.key = w(u, v) 8 + 7 2