Becky Hamilton
New Member
Consider the recurrence relation T(n) =2
if n = 1, T(n−1) + 4n−2
if n > 1
(i) Derive the closed form expression f(n) for this recurrence relation.
(ii) Prove that T(n) = f(n),∀n ∈N
if n = 1, T(n−1) + 4n−2
if n > 1
(i) Derive the closed form expression f(n) for this recurrence relation.
(ii) Prove that T(n) = f(n),∀n ∈N
Last edited: