(a) [12 points] Start with an empty B Tree with minimum degree t = 2, and show the inter- mediate B-Trees resulting from inserting the following keys one after the other in the given order: M, Y, C, T, S, G, E, A, N, U, B, I. (b) [4 points] Show the B-Tree resulting from deleting the key E.