Finding Big O from non-standard recurrence relations without master method

A questionable proof to find recurrence relations for most T(n) = aT(n/b) + O(k). I also explain some intuition behind recursion trees. Probably useful for my CS2040 (DSA) pals.