4.15 lab: mad lib - loops mad libs are activities that have a person provide various words, which are then used to complete a short story in unexpected (and hopefully funny) ways. write a program that takes a string and integer as input, and outputs a sentence using those items as below. the program repeats until the input is quit 0. ex: if the input is: apples 5 shoes 2 quit 0 the output is: eating 5 apples a day keeps the doctor away. eating 2 shoes a day keeps the doctor away.

Idon understand these and need some ! ?

Three out of five seniors remain undecided about a college major at the end of their senior year.

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