Suppose there exists an undirected graph G = (V, E), whose edges can only be accessed through a black box query structure. That is, to determine whether (u, v) E, you query the black box and it returns yes or no. Prove that, in order to determine if G is connected, any algorithm must, in the worst case, query the existence of every possible edge (u, v).