undefined

2 Consider the following graph: 10 marks D 13 25 B G 10 14 20 23 6 E . 15 18 9 13 7 8 Each node in the graph represents remote Himalayan villages in Nepal devastated in a recent earthquake. Electricity distribution system in the region broke down after the incident. As an engineer, you are given the task to reestablish the connection. Each village can be connected by wire to one of its neighboring villages at a cost denoted by the edge between them. One of the villages will be later connected to a nearby power station. Since there is a scarce of resources in this situation, you have to come up with a plan that allows to connect each villages with the minimum cost. Identify the problem, the type of problem and solve the problem. You should show your steps carefully and must provide a graph that shows how the villages should be connected to each other. State the time complexity of the algorithm you used