Write a c++ program to ouput the amount of money that wouldbe present in a bank account some year in the future (named"future"), if x dollars was invested during some earlier year (named "start") chosen by the user. the money is to becompounded at an annual interest rate (named "rate") chosen by theuser. use a loop.

Consider the simple 3-station assembly line illustrated below, where the 2 machines at station 1 are parallel, i.e., the product only needs to go through one of the 2 machines before proceeding to station 2.what is the throughput time of this process?

Who can provide you with a new password when you have forgotten your old one? your provide you with a new password in case you forget your old one.

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