Assume that a pseudocode program contains the following module:
Module display(Integer arg1, Real arg2, String arg3)
Display "Here are the values:"
Display arg1, arg2, " ", arg3
End module

Assume that the same program has a main module with the following variable declarations:
Declare Integer age
Declare Real Income
Declare String name

Write a statement that calls the display module and passes these variables to it.

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