Master Theorem Case 3 (work-dominated recurrence)

When the per-call work f(n) outgrows the watershed n^(log_b a), the recurrence is dominated by the top level and T(n)=Theta(f(n)).