No code needed

Construct a B-tree for the following set of key values: (2,3,5,7,11,17,19,23,29,31,37,41) under the assumption that: a, d = 2 and e=2. b, d = 4 and e = 2. Recall that 2d - 1 and 2e - 1 are the number of index records per block and the number of records per block respectively. For each B-tree of Exercise 1, show the form of the tree after each of the following operations: a. Insert9 b. Insert 10 c. Insert 8 d. Delete 23 e. Delete 19 Suppopse that we are using hashing on a file containing records with the following key values: 2,3,5,7,11,17,19,23,29,31 Show the hash structure for this file if the hash function is h(x) = x mod 8 and buckets can hold three records