Respuesta :
Answer:
The recursive function which best represents the sequence is:
f(n)=f(n-1)+6
Step-by-step explanation:
A sequence has its first term equal to 8, and each term of the sequence is obtained by adding 6 to the previous term.
i.e. f(n) represents the n th term of the sequence
Then, f(1)=8
f(2)=f(1)+6
f(3)=f(2)+6
in general, f(n)=f(n-1)+6
Hence, the recursive function which best represents the sequence is:
f(n)=f(n-1)+6