Import java. util. scanner;
public class rental
{
private double total;

public void settotal()
{
system. out. println("rental total set");
}
public static void main(string[] args)
{
scanner sc = new scanner(system. in);
system. out. print("enter rental type: \n"
+ "'c' for canoe rental\n"
+ "'j' for jet ski rental\n");
string rentaltype = sc. next();
rental rental = new rental();
if (rentaltype. equalsignorecase("c"))
rental = new canoerental();
else if (rentaltype. equalsignorecase("j"))
rental = new jetskirental();
rental. settotal();
}
}

How do i get the most points, without any effort?

In he example code, what does the title attribute create? a tool tip an element a source a markup

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