One of the goals in this course is to use advanced data structures to implement efficient algorithms. The purpose of this assignment is to understand B-Tree algorithms in order to use advanced data structures on secondary storage. TASK: Suppose that we have a set of keys to insert into an empty B-tree with minimum degree t = 2. That means each node is able to hold at least one (t-1 = 1) key and at most three (2t - 1 = 3) keys in the tree. Your task is to show the results of inserting the keys F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A, B, X, Y, D, Z, E in order into an empty B-tree. You should show the following: (1) Draw each B-tree right after inserting the key into the tree (80 points). (2) The final B-tree after inserting all the keys in the tree (20 points).