3.

(a) Suppose G is a graph with n vertices and medges. Describe a way to represent Gusing O(n + m) space so as to support in

O(log n) time an operation that can test, for any two vertices and w, whether and ware adjacent.