Let G = (V, E) be an undirected, connected graph. A vertex u E Vis bridge vertex if removal of v (and edges incident on v) makes the graph disconnected. Suppose that v EV be a bridge vertex. Is there a vertex u E V such that if we perform DFS on G starting at u, the vertex v will be a leaf node in the resulting DFS tree? Given an O(m+n)-time algorithm that gets a graph G (which is undirected and con nected) as input and outputs a vertex v that is not a bridge vertex. Describe your algorithm, derive the time bound, prove the correctness of your algorithm