Given is the B+ tree shown below (n=3 i.e. maximum entries in a node). 9,1417 .2.3.4 9.10.12 14. 15. 16. . 17. 18.22 Execute the following operations in sequence and write down the resulting B+ tree after each operation (only show the resulting tree): I. II. III. IV. Insert (1). delete (14) delete (15) insert (20)