title: What is time-complexity of T(N)=4T(N/2)+(N^2)/logN
body: <p>This question was given in MIT video on analysis of algorithms,
  The following question can not be done using master method and can be solved using recurrence tree.</p>
  
  <p>Can any please tell me the solution?</p>