CPU architecture: Intel Xeon with 64 bit cores Filesystem: Ext4 with 4KB (4096 byte) blocks The customer records are keyed by a random UUID of 128 bits Customers Data record definition from the header file: #include struct CustomerData { uuid_t uuid; // Customer 128 bit key char[32] name; // Customer name (char is 1 byte each) uint32_t ytd_sales; // Customer year to date sales };

A. How tall (on average) will our tree be (in terms of M) with N customer records?

B. If we insert 30,000 CustomerData records, how tall will be tree be?

C. If we insert 2,500,000 customers how tall will the tree be?

UUID UUID UUID UUIDJUUID UUID CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData CustomerData Figure #1: Visualization of our B+ Tree of height 2, customer data records, and pointers between the leaf nodes