Write code that will separate the values in the array into three different arrays named negative Split, postiveSplit, and zeroSplit. Were negative Split will have all elements with values less than zero from the original array, positiveSplit will have all the elements with values above zero from the original array, and zeroSplit will have all the elements with values equal to zero from the original array.

Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?