[7 pointsl Tree Indexing: You are given a series of records whose keys are letters. The records are inserted in the following order: C, S. D, T, A, M, P. I, B, W, N, G, U, R, K, E, H O, L, J** a. 4 points] Show the B+-tree of order four that results from inserting these records Assume that the leaf nodes are capable of storing up to three records. b. 13 pointsl Show the result of deleting three values in the following order S, N, T from the B+-tree generated in part a