Consider the following B+tree: Figure 3: B+ Tree of order d=4 and height h=2. Use the following instructions: - A left pointer in an internal node guide towards keys . - A leaf node underflows when the number of keys goes below [(d1)/2]. - An internal node underflows when the number of pointers goes below [d/2] Insert a key value 22 into the B+ tree, then delete 2 . Select the resulting tree - An internai noae unaerriows wnen tne number or pointers goes beiow 1 al