4. Let G be a connected undirected graph. Suppose we start with two coins on two arbitrarily chosen vertices of G, and we want to move the coins so that they lie on the same vertex using as few moves as possible. At every step, each coin must move to an adjacent vertex. (a) Lab Describe and analyze an algorithm to compute the minimum number of steps to reach a conguration where both coins are on the same vertex, or to report correctly that no such conguration is reachable. The input to your algorithm consists of a graph G = (V, E) and two vertices u, v e V (which may or may not be distinct)