In a video game, the goal is to visit five different lands, \(V, W, X, Y\) and \(Z\), without losing all your lives. The paths between the lands are rated for danger, 1 being lowest and 10 being highest. Once a path has been traversed successfully, it is free from danger. The ratings are given in the table.

Draw a weighted graph to represent the given information. Then use the graph to find a minimum spanning tree and give its weight. Explain what the weight represents in the given scenario.

Transcribed Image Text:

> W v W X 2 Y Z 2 4 9 10 X 4 6 9 Y 9 8 7 8 No Path 7 No Path N 10 No Path No Path 5 Danger Ratings between Lands 5