Could you guys me with number 4 and 5 and also show the work how you got the answer

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 !

For the inequality |c| < |d| to be true, which of the following must be true?

Marquise has 200 meters of fencing to build a rectangular garden. the garden's area (in square meters) as a function of the garden's width w w (in meters) is modeled by: a ( w ) = − w 2 + 1 0 0 w a(w)=−w 2 +100w what side width will produce the maximum garden area? meters