6. Let G =(V, E) be a loop-free graph with |V| =n≥ 2. For all x,y ∈ Vand x≠y, deg(x)+deg(v) ≥ n-1. Prove that G is connected.