Can you please explain how to use substitution method to solve this problem?

I got until but I don't understand how to reduce it

Problem 1 (2 points) Solving Recurrence Relations Draw the recursion tree for T(n) = 3T (Ln/2.) + cn, where c is a constant, and provide a tight asymptotic bound on its solution. Verify your bound using the substitution method