Could you solve this problem and explain how 1) 2) need to be proof?

1)What it means to provide a tight asymptotic bound on this solution?

2) How can I verify the bound using the substitution method?

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