If the base address of an array is located at 0x1000fff4, what would the following instructions be equivalent to (assume this array has the name, my_array)? li $t0, 45 li $s1, 0x1000fff4 sw $t0, 8($s1) group of answer choices my_array[0] = 45 my_array[1] = 45 my_array[2] = 45 my_array[8] = 45 my_array[0] = 0x1000fff4 my_array[1] = 0x1000fff4 my_array[2] = 0x1000fff4 my_array[8] = 0x1000fff4

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)?