Assume that you have just built a dense b+ tree containing100,000 records, with one record per disk sector. the key field is a 20 byte string. pointers (i. e. record ids) are 4 byte values. the size of one disk sector is 1024 bytes. the index was built in a bottom-up fashion using the bulk-loading algorithm and that the nodes at each level were filled up as much as possible. a node corresponds to a disk sector.

a. how many key/pointer pairs fit within a b+ node?
b. how many levels does the resulting tree have?
c. how many leaf nodes are used by the tree?
d. how many total nodes (root, internal, leaf) are required?

A(n) is a small bit of text separated from the rest of the paragraph at the top of a column or page.

What does operator overloading allow you to do?

4.11 painting a wall (1) prompt the user to input integers for a wall's height and width. calculate and output the wall's area (integer). note that in this case there is a new line after each prompt. (submit for 1 point). enter wall height (feet): 11 enter wall width (feet): 15 wall area: 165 square feet (2) extend to also calculate and output the amount of paint in gallons needed to paint the wall (floating point). assume a gallon of paint covers 350 square feet. store this value in a variable. output the amount of paint needed using the %f conversion specifier. (submit for 2 points, so 3 points total). enter wall height (feet): 11 enter wall width (feet): 15 wall area: 165 square feet paint needed: 0.471429 gallons (3) extend to also calculate and output the number of 1 gallon cans needed to paint the wall. hint: use a math function to round up to the nearest gallon. (submit for 2 points, so 5 points total). enter wall height (feet): 11 enter wall width (feet): 15 wall area: 165 square feet paint needed: 0.471429 gallons