C
1.tantas
2.tantas
3.tantos
4.tanto
5.tantas
D
1.tantas
2.tantos
3.tantos
4.tantos
5.tantas
6.tantos
Answer:
The first terms of this sequence should be:
f(1) = 65536
f(2) = 256
f(3) = 16
f(4) = 4
f(5) = 2
Explanation:
It is required to show the first tems of the sequence defined by the rule:

In this sense, it is required to calculate f(n-1) in order to calculate f(n).
First term f(1) = 65536 is given in the problem. So, we can calcualte the other terms by replacing in the recursive formulation for this sequence as follows:

So we have that f(4) = 4.
Finally the term 5. f(5)

Finally, we can conclude that The first terms of this sequence should be:
f(1) = 65536
f(2) = 256
f(3) = 16
f(4) = 4
f(5) = 2
Well, I can't completely help, but I do know some tricks.
For example, write it out fully in English, or the best language you have fluently, then put the whole essay into a translator. Next, make a new document, and copy and paste the translated version into it. Read it out many times, get some quick help (I know some podcasts that can help you learn Spanish easier, like Duolingo) and, once you have learned a bit more (another trick is to read through it using the translator, and see some of the translation parts to learn more Spanish from words that you used) filter out any kinks, and turn it in! It seems harder written out than it is, but it's an efficient way!