You are given a connected graph G(V, E) with weights assigned to its edges. Suggest an O(m log n) time algorithm to find the smallest value r such that if we remove from G every edge with weight>, then the graph is still connected. In other words, we want to remove from G all the expensive edges, and prefer to be as cheap as possible. You are given a connected graph G(V, E) with weights assigned to its edges. Suggest an O(m log n) time algorithm to find the smallest value r such that if we remove from G every edge with weight>, then the graph is still connected. In other words, we want to remove from G all the expensive edges, and prefer to be as cheap as possible