The diagram represents a network with weighted edges.
- Draw a minimum spanning tree for this network and determine its length. (3 marks)
- The network is revised by adding another vertex, `K`. Edges `AK` and `CK` have weights of 12 and 10 respectively, as shown.
What is the length of the minimum spanning tree for this revised network? (1 mark)