Find a shortest spanning tree by Kruskal’s algorithm. Sketch it.

Find a shortest spanning tree by Kruskal€™s algorithm. Sketch it.

20 (1) (2 6 6, 10 (6) (5 12 2. 4.

PROBLEM SET 23.3: