Connectivity 10 Points Ch.3. Ex.9): Consider an undirected graph G (V,E) with IV-n nodes. Assume that there are two nodes s and t with distance between them strictly greater than e node v, different from s, t, suo from G disconncts s from t. Draw one example of G,s,t, v. Provide an algorithm that finds such a node v in O() time