I WILL GIVE BRAINLIEST TO WHOEVER ANSWERS FIRST Create a situation that can describe the recursive function f(1)=10, f(n)=f(n−1)+12, for n>1.
(2 points)

I acctually dont know the answer but can you stilll give meh brainliest! pls pls pls i really need it ohh and you can go to my page and answer as many questions for freee points!

The answer is:O f(1) = 10, f(n) = f(n − 1) + 2, for n > 1

Step-by-step explanation:

f1=10 because the first number is 10. then f(n)=f(n-1)+2 for N because it goes up 2 every time.

7! = 7×6×5×4×3×2

3! = 3× 2

as 7! is multiple of 3! because 7! contains 3! that is 3× 2 as factor

so 7! /(3! ) = 7× 6× 5× 4

= 42 × 20

= 840

its b) 840✌✌✌

dhruv⭐

21

step-by-step explanation: