C-13.4: Suppose G is a graph with n vertices and m edges. Describe a way to represent G using O(n +m) space so as to support in O(log n) time an operation that can test, for any two vertices v and w, whether v and w are adjacent. Additionally, the representation of G should support deletion of an edge in O(log n) time.