Problem
1. For each of the following two B+ trees, show the steps involved in the following queries: (10 points) (Note: there are two B+ trees. You are supposed to answer question #a and #b for both trees).
a. Find records with a search-key value of 7.
b. Find records with a search-key value between
3 and 17, inclusive.
2. Suppose you need to sort a relation of 40 gigabytes, with 4 kilobyte blocks, using a memory size of 40 megabytes. Suppose the cost of a seek is 5 milliseconds, while the disk transfer rate is 40 megabytes per second. (6 points)
a. Find the cost of sorting the relation, in seconds, with bb = 100.
b. How many merge passes are required?