Which recursive formula can be used to generate the sequence shown, where f(1) = 5 and n > 1? 5,–1, –7, –13, –19

step-by-step explanation:

if x = 2 you have to find x to finish the problem

a, b, c, d are correct.

step-by-step explanation:

we have g(x) = 3 and are required to find which option is a translation of g(x).

now, 'translation' is a transformation which means to shift the function in any direction and the general form of translation is g(x) + k, where k is any real number.

so, according to the options we see that all are correct as they satisfy the general form of translation.

also, it can be seen from the graph below that the function g(x) = 3 is shifted from its position in all the four options.