Let M be an ordered map with n entries. Show how to modify the AVL tree to implement the following function for M in time O(log n). count All In Range(k₁,k₂): Compute and return the number of entries in M with key k such that k₁ ≤ k ≤ k₂.