Suppose you have a balanced tree implementation in which Insert (x, T), Delete (x, T), Successor (x, T), and Predecessor (x, T) all take O(log n)-time. Describe how you would change the implementation and/or data structure so that Successor and Predecessor run in O(1)-time and Insert and Delete remain O(log n)-time. Be sure to clearly explain how each of the operations change