Suppose that a mips computer system has a data memory that contains 4 memory modules each of which has a width of 32 bits and a depth of 134217728. show an instruction sequence containing only mips true-op instructions that reads an ieee 754 single-precision floating point number from memory and places the floating-point value into register $f8 without causing any kind of exception. the floating-point value resides at memory address 161061273410 (decimal 1610612734).

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