Let D be a dictionary ADT with N items implemented with a AVL tree. Show how to implement the following method countAllInRange(k1,k2) for D. This method should compute and return athe number of keys in D such that k1 k k2. Your algorithm should run in time O(log n).