Consider inserting the following keys: 12, 22, 23, 15, 80, 34, 56, 78, 39, 8, 44, 74, 35, 53, 82, 77, 66, 90, 54, 18, 7, 64, 60 1. Insert the above keys, respectively, into an empty B+-Tree of order 5, where each leaf can contain up to 5 keys. 2. Show the resulting B+-Tree after deleting keys 18, 19, and 20, respectively, from the following B+-Tree. 18 23 45 10 12 15 18 19 20 21 22 23 30 31 45 47 48 50 52