Asequence has its first term equal to 4, and each term of the sequence is obtained by adding 2 to the previous term. if f(n) represents the nth term of the sequence, which of the following recursive functions best defines this sequence? (1 point) f(1) = 2 and f(n) = f(n − 1) + 4; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2n; n > 1 f(1) = 2 and f(n) = f(n − 1) + 4n; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2; n > 1 i will award !

Option D

Step-by-step explanation:

A sequence has its first term f(1) = 4 and each term of the sequence is obtained by adding 2 to the previous terms.

Now we have to design a recursive formula for the nth term of the sequence.

f(n) = f(n-1) + 2 where n > 1 and f(1) = 4

Here f(n) means nth term

and f(n-1) is the previous term of the nth term of the sequence.

Option D will be the answer.

area = length x width

length = 2 x width

32 = 2 x width x width

32 = 2 x width^2

36 = width ^2  

width = 6

length = 12

area is 32

perimeter = 2 x 12 + 2 x 6 = 24 + 12 = 36

step-by-step explanation: