Draw the recursion tree for T(n) = 5T(floor(n/2))+cn where c > 0 is a constant. Provide an asymptotically-

tight upper bound and then use the substitution method to prove that your bound is correct.