Question 2 (20 points) Consider the foowing B+ index. 17 5 13 24 30 14 16 1) (5 points) Show the B+ tree that would result from inserting data entries with key 30, 31, and 40 into the tree. 2) (5 points) Given the output of (1), show the B+ tree that would result from deleting the data entry with key 2 3) (5 points) Given the output of (2), show the B+ tree that would result from deleting the data entry with key 3. 4) (5 points) Given the output of (3), show the B+ tree that would result from deleting the data entry with key 14