Please help me out :(

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 !

Acompany manufactures three types of cabinets. it makes 110 cabinets each week. in the first week, the sum of the number of type-1 cabinets and twice the number of type-2 cabinets produced was 10 more than the number of type-3 cabinets produced. the next week, the number of type-1 cabinets produced was three times more than in the first week, no type-2 cabinets were produced, and the number of type-3 cabinets produced was the same as in the previous week.

Given: jk ||lm prove: _2 = 27 statement justification 1. jk ||lm 1. given 2.26 = 27 3.22 = 26 2. 3. 4. _2 = 27 4. corresponding angles theorem transitive property of equality vertical angles theorem substitution property of equality