I am struggling to understand how to convert a general form to the final proof of the big.
For example assume the recurrence T(n-2) + 1 the general form is (my guess) T(n - 2k) + k but how would I show that this is big O of something
1 t(n-2) + 1
2 t(n-4) + 2 \
I am using the iteration method by the way and base case is T(0) = 1
The full question is below
question (this is not homework but last years midterm which he said he will not be giving the solution)
