Draw the recursion tree for t(n) = 4t(n/2) + cn, where c is a constant, and provide a tight asymptotic bound on its solution. Prove your bound by mathematical induction.