title: Master Theorem,Solving the recurrence , T(n)=3T(n/2)+nlogn
body: <p>T(n) = 3 * T(n / 2) + n * log(n)</p>
  
  <p>Which case should be applied and why? I think case 1 but not sure.</p>
  
  <p>Master Theorem:</p>
  
  <p><a href="https://i.stack.imgur.com/udNdn.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/udNdn.png" alt="enter image description here"></a></p>