Question: Suppose you have a relation r with nr tuples on which a secondary B+-tree is to be constructed.
a. Give a formula for the cost of building the B+-tree index by inserting one record at a time. Assume each block will hold an average of f entries, and that all levels of the tree above the leaf are in memory.