Prove that a graph G with at least four vertices is 2-connected if and only if for every pair X, Y of disjoint vertex subsets with |X|, |Y| is greater than or equal to 2, there exist two completely disjoint paths P1, P2 in G such that each has an endpoint in X and an endpoint in Y and no internal vertex in X or Y.