We are learning how to solve recurrence relations in different ways (Forward Substitution, Backward Substitution, Master Theorem, etc...). I really thought I understood the topic since most of the problems were in the form of $aT(\frac{n}{b}) + f(n)$ where applying the Master Theorem is no sweat, but we're given this recurrence relation wherein there is a constant inside the recursive term, I am not sure anymore if Master Theorem would still work, or is there another way?
\begin{align*} T(n) = 3T\left(\frac{n}{3}-2\right) + \frac{n}{2} \end{align*}
This one has a constant 2 inside the term, and I don't know how to show that this recurrence relation is upper bounded by $ O (n \log n) $.