Argue that the solution to the recurrence T(n) = T(n/3) + T(2n /3) + cn, where c is a constant, is Ω(n lg n) by appealing to a recursion tree.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.