Assume userName equals "Tom" and userAge equals 22. What is printed on the console when the following statement is executed? System. out. println(userAge + " \nis " + userName + "'s age."); Select one: a. 22 is Tom's age. b. 22 is Tom's age. c. 22 \nis Tom's age. d. 22 \n is Tom's age.

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