Which recursive formula can be used to generate the sequence below, where f(1) = 6 and n ≥ 1? 6, 1, –4, –9, –14, … f (n 1) = f(n) 5 f (n 1) = f(n) – 5 f (n) = f(n 1 ) – 5 f (n 1) = –5f(n)

probably a 9

explanation:

answer:

none of the above. although a banana can be turned into a liquid

answer:

way tho

are you not happy with it

answer:

explain more

explanation:

i don’t understand what you’re asking. elaborate more on that . also give me brainliest!