Solve the following recurrence relation

Solve the following recurrence relation. Give an exact solution: T(n) = T(n - 1) + n/2 T(1) = 1 Prove that T(n), which is defined by the recurrence relation T(n) = 2T([n/2]) + 2nlog_2n T(2) = 4 satisfies T(n) = O(nlog^2n)