The question asks me to find out the time complexity of the recurrence relation t(n)=t(n/5)+t(n/3)+t(2n/3)+n.

I have tried my best to find out the solution to the recurrence relation using the recursion tree method (as in the picture). But at one stage I am getting value as 6n/5 which is greater than 1 and I cannot proceed from here. How do I find out the result from this stage?

And what will be the result?