data structures

9. For the B+-Tree where M=3 and L=5 shown below , show how an insert of value 71 is handled. II 24 11 75 II 1I 10 1 16 I I 1 41 1 50 II 11 82 11 90 I I 50 65 70 72 73 82 83 86 89 90 92 93 95 10 2 5 7 16 24 18 26 20 30 21 33 35 41 42 45 47 48 75 78 80 81 14 15 10. Suppose a node in a B+-tree is stored in a disk block, and suppose the block holds 2048 bytes. What is M if each key is 18 bytes and each pointer is 4 bytes? What is L if each record is 256 bytes'? What is the worst-case height of the tree if storing 500000 records