I've been tasked with solving some recurrence relations, and I've been running into trouble with so called 'chip & conquer' relations.Here are some example problems:$$T(n) = T(n-5) + cn^2$$and$$T(n) = T(n-2) + \log{n}$$I'm supposed to be giving an answer in $\Theta$ notation. How do I go around and solving relations like these?
Solving Recurrence Relations 'Chip & Conquer'
asymptotics;recurrence relation