Show the B-trees that result after each successive deletion of the
keys J, O, H, X, T, R, S, F, C, K, P, G, E, L, I (in this order) from the
following B-tree with minimum degree t = 2. When you have a choice
between a left or right sibling, always choose the left sibling. Always
try Case 2a (predecessor) before Case 2b (successor).