ALGORITHMS/TREES

[8 points] Find the values of M and L for a B-tree if the disk block size is 4096, a key uses 16 bytes, a link uses 8 bytes, and a data value uses 128 bytes. For 1,000,000 values, how many levels would need to be accessed in the worst case? How many levels would need to be ad- cessed in the best case for a binary search tree? 8