Let G be a connected graph of order n>=4 and let k be an integer with 2 <= k <= n-2:

1) Prove or disprove: If G is a connected graph with a cut-vertex, then G contains a bridge.

2) Prove that if G is not k-connected, then G contains a vertex-cut U with |U|=k-1