10 points 6. For the B+-tree where M=3 and L=5 shown below, show how an insert of value 80 is handled |l 12 11 50 1 50 65 70 72 12 7 20 21 10 points 7. For the B+-tree where M-3 and L-5 shown below, show how an insert of value 28 is handled 1l 24 11 75 1I |l 10 11 161 41 1 s0 I1 82 9 II 16 24 18 26 20 30 21 33 35 50 65 70 72 75 78 80 81 82 83 86 90 92 93 45 47 10 points 8. A B+-tree is to be stored on disk whose block size is 3096 bytes. The data records to be stored are 36 bytes, and their key is 4 bytes. Determine the values for M and L for the B+-tree. Assume pointers are 4 bytes each. 8 points 9. For the problem above, how many levels are needed to store 8,600,000 records? 8 points 10. If a binary tree has N nodes, how many null child pointers will it have? Explain your reasoning 8 points 11. In a perfect binary tree (one filled at every level), what does adding another level do to the number of nodes in the tree