Question 2. (1 marks) Let In be the set of n integers {1, 2,...,n} where n is some power of 2. Note that we can easily use an n-bit vector i.e., an array of n bits) B[l..n] to maintain a subset S of In and perform the following three operations (where j is any integer in In) in constant time each: INSERT(j): insert integer j into S. DELETE(): delete integer j from S. MEMBER(): return true if je S, otherwise return false. Describe a data structure that supports all the above operations and also the following operation MAXIMUM: return the greatest integer in S such that: The worst-case time complexity of operations INSERT(j), DELETE(), and MAXIMUM is O(log n) each. The worst-case time complexity of MEMBER(j) is O(1). The data structure uses only O(n) bits of storage. Note that the binary representation of an integer i where 1