The Map operation findAllInRange(k₁,k₂) returns all of the elements of the Map whose keys are between k₁ and k_2. Explain how to implement this operation, and give its running time, for each of the following Map implementations:

e) Binary search tree

f) AVL tree

g) 2-4 tree

h) Hashtable