Let $$T(n) = 2T(\frac{n}{2}) + \frac{n}{\log(n)}$$ Canno't be solved using the master theorem, and $$T(n) = 4T(\frac{n}{2}) + \frac{n}{\log(n)}$$ Can be solved. Why is that?
Theorem: https://en.wikipedia.org/wiki/Master_theorem_(analysis_of_algorithms)