QUESTION A video conference is to take place in the network shown in Figure 1 To transport the communication efficiently through this network we need a minimum spanning tree network which connects...

file attached


QUESTION A video conference is to take place in the network shown in Figure  1 To transport the communication efficiently through this network we need a minimum spanning tree network which connects these nodes through the existing links. Find such a minimum spanning tree, i.e. a network with the minimum total length which connects all these nodes. Make sure to explain all your reasoning, including a selection of steps of your algorithm which make it clear that you have carried it out systematically. The solution for the minimum spanning tree problem that you have found should be given and it should achieve the minimum possible total cost (ie the sum of link costs for this network is the minimum possible). Is the minimum spanning tree that you found unique? Give your reasons. Figure 1 CRITERIA 1. The minimum spanning tree algorithm has been carried out on the network of Figure 1 and sufficiently many steps shown to confirm that it has been done correctly. 2. Your solution has been stated clearly and it has the minimum possible cost. 3. Whether this solution is minimum in cost is correctly identified.