Answer:
a) The car will be worth $8000 after 2.9 years.
b) The car will be worth $6000 after 4.2 years.
c) The car will be worth $1000 after 12.7 years.
Step-by-step explanation:
The value of the car after t years is given by:

According to the model, when will the car be worth V(t)?
We have to find t for the given value of V(t). So





(a) $8000
V(t) = 8000

The car will be worth $8000 after 2.9 years.
(b) $6000
V(t) = 6000

The car will be worth $6000 after 4.2 years.
(c) $1000
V(t) = 1000

The car will be worth $1000 after 12.7 years.
Answer:
Three Times.
Step-by-step explanation:
First and foremost a binary search requires that the array be sorted in ascending or descending order.
After the initial step the search goes to the middle most value
i.e.
will be the second 14, which is the first iteration.
Since 14 is less than 19 the search will eliminate the lower half of the including 14, and will iterate again through the array:
![[15,18,18,19,19]](https://tex.z-dn.net/?f=%5B15%2C18%2C18%2C19%2C19%5D)
The array will go to the middle most value which is 18, second iteration. Since 18 is less than 19, the program will eliminate the lower half and be left with two values i.e.
.
The search will run once i.e. third iteration, and will return key value found.
Answer:
156
Step-by-step explanation:
The answer is in my attachment