Suppose that an n-vertex undirected graph G = (V, E) has vertices s and t with the distance from s to t strictly greater than n/2. Show that there must exist some vertex v, not equal to either s or t, such that deleting v destroys all s - t paths. (This could be phrased as: show that a graph with diameter strictly greater than n/2 has an articulation point.) Give an algorithm that finds v in O(n + m) time, you can assume that you are given the vertices s and t that have separation of greater than n/2