P1) The minimum degree (G) of a graph G is the minimum of its degrees: (G)=min{degG(v):vV(G)}. Prove that for any graph G, its vertex connectivity is less than or equal to its minimum degree.[Hint: A clean way to prove this is by supposing that the vertex connectivity is strictly greater than the minimum degree and deriving a contradiction.]