Let G = (V, E) be an undirected, connected graph with |V | = n. Let s, t V be such that the shortest path distance from s to t is > n/2.

A. Prove that there is a vertex v V , where v =/ s and v =/ t, such that removing v from G destroys all paths between s and t.

B. Give the pseudocode for a linear-time algorithm Find-Break that returns such a v.