Prove that a graph with \(n\) vertices, the degree of each of which is at least \(\frac{n-1}{2}\), is connected.