Write a program that reads a connected graph from a file and displays its minimum spanning tree. The first line in the file contains a number that indicates the number of vertices (n). The vertices are labeled as 0, 1, . . . , n−1. Each subsequent line describes the edges in the form of u1, v1, w1 | u2, v2, w2 | . . . . Each triplet in this form describes an edge and its weight. Figure 29.23 shows an example of the file for the corresponding graph. Note we assume the graph is undirected. If the graph has an edge (u, v), it also has an edge (v, u). Only one edge is represented in the file. When you construct a graph, both edges need to be added.

100 File 6 3. 20 0, 1. 100 1, 3, 20 2, 3, 40 | 2, 4, 2 3. 4. 51 3, 5, 5 4, 5, 9 40 | 0, 2, 3 2 5 (a) (b)