Exercise 3 (Minimum spanning tree) Consider the following graplh: 6 4 12 2 (i) Draw a minimum spanning tree (by hand) and give its cost (ii) Suppose Kruskal's algorithm is run on this graph; whenever there is a choice of edges, pick the one with whose vertices sum to the lowest value. Give the order that the edges are added (iii) Suppose that Prim's algorithm is run on this graph; whenever there is a choice of vertices, pick the one with the lower number. Draw a table showing the cost of each vertex at each iteration of the algorithm along with list the vertices contained in H at the end of each iteration