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

The great thing about this problem is they give you everything you need to solve it easily. so the expression is: 12h+30w12h+30wand so everywhere you have an “h” you place 66. and everywhere you have a “w” you place 33. then the expression will look like this: 12(66)+30(33)12(66)+30(33)from here you multiply and then add. getting the following of: $785,862hope this

What is the problem?