1(a) Use Kruskal's algorithm to draw the resulting spanning tree andlist the edges in the order they are picked by Kruskal's algorithm.(b) Use Prim's algorithm, starting at H, to draw the resulting Question 6. [3 marks] Find a minimum spanning tree of the given graph below. 1 (a) Use Kruskal's algorithm to draw the resulting spanning tree and list the edges in the order they are picked by Kruska 1 answer