title: Recurrence: T(n) = 3T(n/2) + n^2(lgn)
body: <p>Here is the full question...</p>
  
  <p>Analysis of recurrence trees. Find the nice nonrecursive function f (n) such that
  T(n) = Θ( f (n)). Show your work: what is the number of levels, number of instances on each level, work of each instance and the total work on that level.</p>
  
  <p>This is a homework question so I do not expect exact answers, but I would like some guidance because I have no idea where to start. Here is part a: </p>
  
  <p>a) T(n) = 3T(n/2) + n^2(lgn)</p>
  
  <p>I really have no idea where to begin. </p>