a) We are applying Kruskal’s algorithm on this graph, show theset-of-sets after processing every edge.
b) How many operations of each type are necessary to completethe algorithms? (MAKE, FIND, UNION)
8 9 2 4 14 5 10 8 2 Show transcribed image text 8 9 2 4 14 5 10 8 2
Answer