Which of the following recurrence relations corresponds to the sequence 2, 1, 0, -2, -5,...? ○ a₁ =2 a₁ = 1 a=3-a an-1-n⋅ am-2 +1 for n ≥2 O a₁ = 2 a₁ = 1 a=3-a-1-2a2+1 for n≥2 Oa₁ = 2 a₁ = 1 a=2-an-1-0 ○ a₁ = 2 an=a n-1 n-2 for n ≥2 -1 for n ≥ 1

Solve this recurrence relations together with the initialconditions given. a_{n+2} = −4a_{n+1} + 5a_n for n ≥ 0, a_0 = 2, a_1 = 8

Consider the following recurrence relations: А. ТА(п) 2× TA(꽃) +n B. Tp(n) = 4 × Tâ() +n² C. Tc(n) = 8 × Tc()+n D. Tp(n) =8×Tp(플) + 1 and T4(1) = TB(1) = Tc(1) = Tp(1) = 0(1) || Problem: Assuming that each node in their respective recursion trees consume the same amount of constant space, which recurrence relation/s has/have the worst worst- case space complexity (O(M(n)))? Would this/these also require the most amount of space or program stack memory?

b) Find the first five terms of the sequences described by the following recurrence relations. an = 3an-1 + 1 for n 2 2 a =2 an = 2an-1 - an-2 for n 23 aj = 3, a2 = 2