1. Prove, disprove (give a counterexample, highlight the incorrectness or give the correct answer) or complete a proof. (h) Let e be any edge of a k-connected graph G, for k> 3, and W={wi, W2,..., Wk-2} be any set of k-2 vertices in G-e, and let x and y be any two different vertices in (G-e) - W. If neither endpoint of edge e is in W and vertices x and y are the endpoints of edge e, then there is an x-y walk in (G-e) - W