Draw the resulting B-trees after inserting each of the keys, 32, 27, and 34, in this order, in the B-tree T1 given above. Each insertion is to be performed on the B-tree obtained from the previous insertion.

Notes: If you need to swap the key to be deleted, swap using its successor If you have two options for borrowing from a sibling, borrow from right sibling. Also if you have two options for merging, merge with right sibling.