Networks, STD2 N2 SM-Bank 3 The diagram below is a connected network. Complete the diagram below to show the minimal spanning tree of this network. (2 marks) Show Answers Only `text(or)` Show Worked Solution `text(One Strategy - Kruskul's algorithm)` `text(There are 6 vertices, so we need 5 edges.)` `text{Edge 1: BC (least weight) - could have chosen ED}` `text{Edge 2: DE (next least weight)}` `text{Edge 3: AF (could have been CD)}` `text(Edge 4: CD)` `text{Edge 5: CF or EF (reject CE as it creates a cycle)}` `text(or)`