Answer:
D)
Step-by-step explanation:
A recursive formula always has two parts: the value of an initial term (or terms), and an equation defining [tex]a_n[/tex] in terms of preceding terms.
From inspection, the initial term is -3
[tex]\implies a_1=-3[/tex]
[tex]\implies f(1)=-3[/tex]
From inspection, we can see that each term is the preceding term multiplied by -3. Therefore, the sequence can be defined as:
[tex]a_n=-3(n-1)[/tex]
[tex]\implies f(n)=-3f(n-1)[/tex]
So the recursive formula for the sequence is D)
[tex]f(n)=\left \{ {{f(1)=-3} \atop {f(n)=-3f(n-1)}} \right.[/tex]
