Define the following sequence recursively: 96, 48, 24, 12, Select one:
a. f(1)=12 f(n−1)=2⋅f(n) n≥2
b. f(1)=12 f(n−1)=−12⋅f(n) n≥2
c. f(1)=96 f(n)=12⋅f(n−1) n≥2
d. f(1)=96 f(n)=2⋅f(n−1) n≥2

I do not see that any of your options will work.

Step-by-step explanation:

a) and b) have a false first statement because f(1) = 96, not 12

c) would create the sequence 96, 1152, 13824

d.) would create the sequence 96, 192, 384. 768...

I believe the correct answer would be

f(1) = 96     f(n) = ½f(n-1)  n ≥ 2

which could be either c) or d) if taking potential typographic errors into account. Recording a "2" or "12" where a "½" ought to be.

kbmflmklbhml; bmlzb; bdhzz

step-by-step explanation: