please help me to solve this problem based on Introduction to Algorithm textbook

Draw the recursion tree for T(n) = 3T ([n/2]) + cn where c is a constant and provide a tight asymptotic bound on its solution. Verify the bound by the substitution method. You need to show the detailed process how the results are obtained. Please in your solution use this formula 9-31.([n/2)) + (110523)