Suppose G is a simple graph with n ≥ 1 vertices such that every vertex has degreeat least (n − 1)/2. Prove that G must be connected.(Hint: you may wish to prove this by induction on n) 2. Suppose G is...

Suppose G is a simple graph with n ≥ 1 vertices such that every vertex has degree
at least (n − 1)/2. Prove that G must be connected.
(Hint: you may wish to prove this by induction on n)

Extracted text: 2. Suppose G is a simple graph with n > 1 vertices such that every vertex has degree at least (n – 1)/2. Prove that G must be connected. (Hint: you may wish to prove this by induction on n).