Hi!! I need help with this 1 database question please.. Please follow the instructions strcitly for your answers... Thanks

Problem 1 Please highlight the changes (or only describe/show the changes) to make it easier for the grader to check your work. For example, if you're splitting node F, you could say split node F into F and F'. Node F has keys . and F has keys Consider the following B+ tree. The structure is described first, followed n - 8. (Therefore internal nodes other than the root must have between Structure by the key values in each node 4 and 8 children and leaves must have between 4 and 7 key values.) The root is node A. Node R has two children: A and B A has four children: C, D, E, F B has eight children: G, H, I, J, K, L, M, N Key values: R: 40 A: 10, 18, 32 B: 48, 62, 74, 82, 100, 200, 300 C: 2, 4, 6, 8 D: 10, 12, 14, 16 E: 18, 20, 22, 24, 26, 28, 30 F: 32, 34, 36, 38 G: 40, 42, 44, 46 H: 48, 50, 52, 54, 56, 58, 60 I: 62, 64, 66, 68, 70, 72 J: 74, 76, 78, 80 K: 82, 84, 86, 88 L, M, N: details not needed for this problenm 1. What nodes are visited and, in each what key comparisons are made, when doing each of the following searches (a) find record with key value 58 (b) find record with key value 32 (c) find all records with key values between 24 and 42,assuming the B+ tree is a secondary index on the data file. (d) find all records with key values between 24 and 42,assuming the B+ tree is a primary index on the data file. Problem 1 Please highlight the changes (or only describe/show the changes) to make it easier for the grader to check your work. For example, if you're splitting node F, you could say split node F into F and F'. Node F has keys . and F has keys Consider the following B+ tree. The structure is described first, followed n - 8. (Therefore internal nodes other than the root must have between Structure by the key values in each node 4 and 8 children and leaves must have between 4 and 7 key values.) The root is node A. Node R has two children: A and B A has four children: C, D, E, F B has eight children: G, H, I, J, K, L, M, N Key values: R: 40 A: 10, 18, 32 B: 48, 62, 74, 82, 100, 200, 300 C: 2, 4, 6, 8 D: 10, 12, 14, 16 E: 18, 20, 22, 24, 26, 28, 30 F: 32, 34, 36, 38 G: 40, 42, 44, 46 H: 48, 50, 52, 54, 56, 58, 60 I: 62, 64, 66, 68, 70, 72 J: 74, 76, 78, 80 K: 82, 84, 86, 88 L, M, N: details not needed for this problenm 1. What nodes are visited and, in each what key comparisons are made, when doing each of the following searches (a) find record with key value 58 (b) find record with key value 32 (c) find all records with key values between 24 and 42,assuming the B+ tree is a secondary index on the data file. (d) find all records with key values between 24 and 42,assuming the B+ tree is a primary index on the data file