it has neither QUESTION 3 Us What is the total time for this spanning tree? e Prim's algorithm to find a minimal spanning tree for the times whose vertices are the hotels given in the distance chart Turnberry Sheraton Old Course Hotel, Devonshire Grand, Ayrshire Hotel, Hot Gardens Edinburgh St Andrews Perthshire 2%hrs 100 mls 2%hrs 100 mls I hr 5hrs 155 ml 1%hrs Turnberry Hotel, One Devonshire Gardens Sheraton Grand, Edinburgh Old Course Hotel, St Andrews Gleneagles Hotel, Perthshire 1%hrs 55 mls 1%hn 75 mls 1 hr 45 mls 50 mls 2whrs 100 mls 1 hr 50 mls 1%hn 60 mls l he 45 ml 1%hrs 75 mls l hrs 50 mls 3 hrs 60 mls 2%hrs 100 mls I hr 45 mls l hr 50 mls 45 mls 4 hours 4.5 hours 5 hours 6.5 hours