Consider the B+ tree index. Every node can contain m entries, where 2 s ms4. • The root node is an exception: it allows 1 sms4. B+ tree 5 12 17 14" 16" |||| 2432 21" 23" 25 29 30 34 36 38 40 A. Show the B+ tree that would result from inserting data entries with key 32, 33, and 44 into the tree. B. Given the output of (A), show the B+ tree that would result from deleting the data entry with key 2. C. Given the output of (B), show the B+ tree that would result from deleting the data entry with key 3. D. Given the output of (C), show the B+ tree that would result from deleting the data entry with key 14.

Consider the B+ tree index. Every node can contain m entries, where 2 s ms4. • The root node is an exception: it allows 1 sms4. B+ tree 5 12 17 14" 16" |||| 2432 21" 23" 25 29 30 34 36 38 40 A. Show the B+ tree that would result from inserting data entries with key 32, 33, and 44 into the tree. B. Given the output of (A), show the B+ tree that would result from deleting the data entry with key 2. C. Given the output of (B), show the B+ tree that would result from deleting the data entry with key 3. D. Given the output of (C), show the B+ tree that would result from deleting the data entry with key 14.