The engineer wants to construct footpaths to link up all eleven locations that are represented by node A to node K in a schematic undirected network in Figure Q5. The weight of each link is the distance in kilometers between the two connected locations. For examples, location A to location C is 2 km and so does from location C to location A. (a) Draw all the minimum spanning tree(s) of the given undirected network, (b) What is the minimum total distance in kilometers to connect all the eleven locations? (c) If node D and node H must be connected in this network, draw the new spanning tree with minimum total distance to connect all nodes. Note: Only one spanning tree is required even there are more than one existed. (d) What is the updated minimum total distance in kilometers to link up all locations? Figure Q5 - Undirected network diagram