Exercise 11.9 Consider the snapshot of the Linear Hashing index shown in Figure 11.12. Ass...

Exercise 11.9 Consider the snapshot of the Linear Hashing index shown in Figure 11.12. Assume that a bucket split occurs whenever an overflow page is created.

1. What is the maximum number of data entries that can be inserted (given thebest possible distribution of keys) before you have to split a bucket? Explain verybriefly.
2. Show the file after inserting a single record whose insertion causes a bucket split.
3. (a) What is the minimum number of record insertions that will cause a split ofall four buckets? Explain very briefly.
   
   Figure 11.13
   (b) What is the value of Next after making these insertions?
   (c) What can you say about the number of pages in the fourth bucket shown after this series of record insertions?