Consider the problem of determining whether an undirected graph G with 2k
vertices is connected ( i.e.whether there is an undirected path between each pair of vertices .Assume that the algorithm is restricted to ask questions of the form" Is there an edge between i and j ?".
Give the best adversary argument you can on the number of such questions required to
determine if G is connected.