3. Let n >= 2 and p>= 1 be two positive integers. Let G be a graph with n vertices such that each vertex has p or more incident edges. Prove

that if p > ((n-2)/2) then G is connected.