assuming that n is a power of 2 $\displaystyle T(n) = (2 + \frac{1}{\log{n}})T(n/2)$ for $\displaystyle n >= 2$ with $\displaystyle T(1)= 1$

Its for an algorithms course and the answer needs to be in asymptotic notation.

I tried repeated substitution but things are getting complicated pretty fast. It does produce some pattern but it is not jumping out at me. Does anyone have some advice on an alternative?