Problem $4$: Proof by Contradiction

If $G$ is an undirected graph on $n$ nodes, where $n$ is an even number. Prove that if every node of $G$

has degree at least $\frac{n}{2},$ then $G$ is connected.

Show work