Please be clear, answer all parts and show all steps. Thank you

Solve the following recurrence relations using any method (Repeated substitution, Charac- teristics functions, Generating functions, or any other method you like). Assume that T(n) is a constant forn 2 (a) T(n) = 2T () + n3 (b) T(n) = T (VA) vn + n (c) T(n)-2Tog (d) (Required for grad students in CS 5720, extra-credit for undergraduates) T(n) = 3T (3) + n log n