Problem
1. Outline a method for deleting an item from an extendible hashing table.
2. Why are "top-down" B-trees better than "bottom-up" B-trees for concurrent access to data? (For example, suppose two programs are trying to insert a new node at the same time.)
3. Implement search' and insert for internal searching using the extendible hashing method.
4. Discuss how the program of the previous exercise compares with double hashing and radix-the searching for internal searching applications.