Computers usually read data from a hard disk in blocks. Suppose that a computer has a 2 KB block size, and you want to build a B-tree or a B+tree that stores customer records using four blocks per...

Computers usually read data from a hard disk in blocks. Suppose that a computer has a 2 KB block size, and you want to build a B-tree or a B+tree that stores customer records using four blocks per bucket. Assume that each record occupies 1 KB, and you want the key value stored by the tree to be the customer’s name, which occupies up to 100 bytes. Also assume that pointers between nodes (or to data in a B+tree) take 8 bytes each. What is the largest order you could use for a B-tree or a B+tree while using four-block buckets? What would be the maximum height of the B-tree and B+tree if they hold 10,000 records?