(10 points) B-tree. Consider a B-Tree in the following scenario: . Disk block size is 2048 21) bytes The key of a record is 4 (= 22) bytes The size of a record is 128 (2) bytes Pointers for internal branches are 4 (-22) bytes a) What is L, the maximum number of records that each leaf can hold? 2of8 12 b) What is M, the maximum number of branches in an internal node? c) IfN 2,097,15222), what is the maximum height of this tree