Construct a B+ Tree of Order P=4 For the following set of key values: (7, 12, 5, 20, 1, 18, 24, 21, 30, 4, 13, 15) a) Assume that the tree is initially empty, and values are inserted in the above given order. Show only the final constructed B+ tree after inserting all the above keys. b) After you construct the tree in part (a), show this B+ tree after the following keys (insert 14, insert 16, then insert 17) are inserted in the given order. Show only the final constructed B+ tree after all these insertions. c) After you finish inserting the keys of part (b), show this B+ tree after the following keys in the given order are deleted (delete 17, then delete 12, then delete 13, then delete 16). Show only the final B+ tree after all these deletions.

Construct a B+ Tree of Order P=4 For the following set of key values: (7, 12, 5, 20, 1, 18, 24, 21, 30, 4, 13, 15) a) Assume that the tree is initially empty, and values are inserted in the above given order. Show only the final constructed B+ tree after inserting all the above keys. b) After you construct the tree in part (a), show this B+ tree after the following keys (insert 14, insert 16, then insert 17) are inserted in the given order. Show only the final constructed B+ tree after all these insertions. c) After you finish inserting the keys of part (b), show this B+ tree after the following keys in the given order are deleted (delete 17, then delete 12, then delete 13, then delete 16). Show only the final B+ tree after all these deletions.