OAD BC ☐AC CD U Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. Which of the edges below are included in the minimum cost tree? U U AB D BD 11 B

1) Using either Prim's or Kruskal's algorithms, determine the cost of the minimum spannin tree which will connect all the vertices of the graph below. State which algorithm you used. 5) Sketch the minimum spanning tree. 5 A F 4 J 2 2 2 4 B 8 G 1 K 13 3 7 C 5 H 4 L 2 2 1 D 7 I 3 1 12 2 E 6 M

----___________________Answer question below_______________________----

help