For Prim's:

For Kruskal's:

For the following graph, show the execution of Prim's and Kruskal's algorithms for finding the MST on it by reproducing tables the likes of which are in the notes from Classes 22-23. Start Prim's algorithm at vertex 15 7 17 9 5 .5 step vertex 1 1 | 2 | 3 | 4 | 5 | 6 | 7 Tree (-0)|(1,7) (1,4) (-,00)|(-00) (-,00) (-,00) {(1,3)} (-0) (3,3)| (-0) (3,9) (3,2) (3,13)| (-,00) {(1,3), (3,5)} (-0) (3, 3)(-0) (3,9) (-,0) (5,8) (5,1) {(1,3), (3,5), (5, 7)) (-.0) (3, 3)(-0) (3,9) (-,0) (5,8) (-0) {(1, 3), (3, 5), (5, 7), (2, 3)} (,0)|(-0) (-0) (3,9) (-0) (5,8) (-0) {(1,3), (3,5), (5,7), (2,3), (5,6)} (-0)|(-,0)(-,0) (6,6) (-0) (-,0)| (-,0) {(1, 3), (3, 5), (3, 7), (2, 3), (5,6), (4, 6)) 4 6 step components forest edges 7 2 {(5,7) {(3,5), (5,7)) 3 4 5 6 2 3 4 {5,7} | 6 2 {3,5,7} 4 6 {2,3,5,7) 4 6 {1,2,3,5,7} 14 6 {1,2,3,5,7} {4,6} {1,2,3,4,5,6,7} {(3,5), (5,7), (2,3)} {(1,3), (3,5), (5,7), (2,3)} {(1,3), (3,5), (5,7), (2,3), (4,6)} {(1,3), (3,5), (5,7), (2,3), (5,6), (4, 6)}