2. A graph G is connected if for every pair of vertices u and v of G there is a u-v path in G. Let G be a graph of order n > 2, and suppose that its minimum degree (G) satisfies 8(G) connected. n-1 2 Prove that G is