A B+-tree is to be stored on disk whose block size is 2048 bytes. The data records
to be stored are 50 bytes, and their key is 4 bytes. Determine the values for
M and L for the B+-tree. Assume pointers are 4 bytes each.
11. For the problem above, how many levels are needed to store 10,000,000 records?