I have a recurrence relation that goes something like this:
$T(n)=T(n_1)+T(n_2)+c_1.n^{3/2}log(n)$
$T(2)=c_2$
Under the conditions:
$n_1+n_2=n$ $\quad$ & $\quad$ $n_1,n_2 \le 2n/3$
How does we solve such recurrence relations in general?
Worst case complexity might be sufficient for this relation. I was trying to apply Master's theorem but the relation isn't in a format for applying such a technique.
Any insight would be of great help. Thanks.