1. Are the following topics covered in the chapter that you were supposed to read for today's class? mark Y (yes) or N (no) for each topic:

- sorting a linked list
- search in a linked list
- sorting an array
- search in an array
- computational complexity

2. To increase the amount of savings, many people hire professionals
to handle their retirement money. When you hire a professional,
your amount grows faster, but you also have to pay a
certain yearly amount to
this professional. Let us assume that the amount increases by 10%, but
you have to pay $100 every year. As a result, if at the previous
year i -1,
you had amount
A_{i-1}, then next year, you will have A_{i} =
1.1 * A_{i-1} - 100. Write a recursive method that, given an amount
A_{0} at year 0 and a year n, computes how much money you will have in
your retirement find by this year. Trace your method on the example
of A_{0} = 2000 and n = 2.
*Hint:* this problem is similar
to Fibonacci numbers.