Using a B-Tree, we want to store and process information concerning the driving records for citizens in the state of Florida.
We assume the following:
≤we have 300,000,000 items,
≤each key is 8 bytes(ID number),
≤a record is 256 bytes,
≤one disk block holds 8,192 bytes,
≤and a pointer to each block is of size 4 bytes.
(a) What are the values of M and L in this case?
(b) What is the number of leaf nodes in the best and worst cases?
(c) What is the height of the B-Tree in the worst case?
This is the lab program assigned to me can any one please tell me whether we should write a program for this or it is just descriptive answers enough??