Database System - Indexing B+ Tree (20 points) Consider the following B+ tree with d-2. For each part, execute the operation on the initial tree and answer the related question For each of the lookup parts, describe which blocks would be read and in which order. For each of the insert and delete parts, apply all the operations (in order) to the given B+ tree and draw the final resulting tree B1 45 B2 B3 15 32 56 B4 B5 B6 B7 B8 5 12 15 30 32 34 45 50 51 56 84 5 12 15 30 32 34 50 51 56 84 1. Lookup record with key 34 (1 point) 2. Lookup record with key 99 (1 point) 3. Lookup record with keys in the range 14 to 44 (2 points) 4. Delete record with key 30 (4 points) 5. Delete records with keys 51 and 34 (6 points) 6. Insert records with keys 53 and 55 (6 points) Database System - Indexing B+ Tree (20 points) Consider the following B+ tree with d-2. For each part, execute the operation on the initial tree and answer the related question For each of the lookup parts, describe which blocks would be read and in which order. For each of the insert and delete parts, apply all the operations (in order) to the given B+ tree and draw the final resulting tree B1 45 B2 B3 15 32 56 B4 B5 B6 B7 B8 5 12 15 30 32 34 45 50 51 56 84 5 12 15 30 32 34 50 51 56 84 1. Lookup record with key 34 (1 point) 2. Lookup record with key 99 (1 point) 3. Lookup record with keys in the range 14 to 44 (2 points) 4. Delete record with key 30 (4 points) 5. Delete records with keys 51 and 34 (6 points) 6. Insert records with keys 53 and 55 (6 points)