Kruskal's Algorithm for MST B 26(9) Step 1:E= 27 21(4) Step 2:Select the edge with 42 E the least weight,and not 36 29 D making a cycle with 34 25(7) 33 22 16(1) members of E 18(3) 21(6 Step 3:Repeat step 2 until E H 21(5) 25(8) contains n-1 edges 28 17(2) End of Algorithm 53Kruskal’s Algorithm for MST 27 26(9) 42 21(4) 21(6) 53 25(8) 33 28 36 18(3) 17(2) 34 29 22 A I H J C E B G F D 16(1) 21(5) 25(7) Step 1: E={} Step 2: Select the edge with the least weight, and not making a cycle with members of E Step 3: Repeat step 2 until E contains n-1 edges End of Algorithm