If you apply the changes below to the absolute value parent function, f(x) = |x|, what is the equation of the new function? Shift 2 units to the right. Shift 3 units down. A. G(x) = |x + 2| – 3 B. G(x) = |x + 3| – 2 C. G(x) = |x – 3| – 2 D. G(x) = |x – 2| – 3

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 !