please help me to answer this question based on introduction of Algorithms book

thank you

Draw the recursion tree for T(n) = 31([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