Use either Kruskal's or Prim's algorithm to find a minimum spanning tree for the graph G given below (Figure 4). Please state the algorithm you choose at the beginning of your solution. Figure 4: Graph G in Q4. a) Write the order in which the edges are added to the tree. b) Draw the minimum spanning tree. c) Is the minimum spanning tree unique? Justify your