Write a program to calculate the monthly payment on a loan given the loan amount, interest rate and the number of years to pay off the loan. then add a function to print an amortization schedule for that loan. create a class to save the current balance and the rest of the data as private data. add member functions to make a payment and to print the amortization report.

The head restraint should be adjusted so that it reaches a.the top of your ears b.the base of your skull c.the top of the head

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

Will this setup result in what kathy wants to print?