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
1. Estoy contento 2. Estas triste 3. Estoy seguro 4. Estamos cómodos 5. Estan abiertas
6. Esta desordenado 7. Estamos ocupados
8. Estoy cansado 9. Estoy aburrido
10. Estoy nervioso 11. Estoy enamorado
12. Estoy feliz
Answer:
( puede's) recomendarme el mejor plato de este
"¿Usted
restaurante?"
"Por supuesto, Señor. Le recomiendo la paella. ¿A usted le
(gustaria) la paella vegetariana o la de mariscos?"
The answer for this problem would be C) los