2. (Adapted from Exercise 18-2.1) a. Insert the following keys, in order, into an empty B-tree with minimum degree t=2 : [1, 15,16,4,3,17,12,2,14,8,7,11,9,6,5,10, 13] You are not required to show any work, though it may be helpful for partial credit purposes if you draw out the tree every time a node splits. b. Do the same as the above, but for a B-tree with minimum degree t=3..