Let T be a wavl tree storing n items, and let k be the key of an item in T. Show how to construct from T, in O(log n) time, two wavl trees T  and T , such that T  contains all the keys of T less than k, and T  contains all the keys of T greater than k. This operation destroys T.