Please submit a hardcopy of your solutions.

For assistance, you may recall that solutions for all odd-numbered exercises are available through the textbook website.

1. Complete Exercise 10.2 of the text.
2. Consider an initially empty, extendible hashing table where each data page holds four items. Draw the final table which results after inserting items with the following hash values, in the following order:
   40, 25, 11, 12, 30, 16, 31, 24, 15, 48, 32, 23, 27

   Please make your diagram as clear as possible.