Draw recursion trees and find big-t bounds on the solutions

Question

Question: Draw recursion trees and find big-Θ bounds on the solutions to the following recurrences. For all of these, assume that T(1) = 1 and n is a power of the appropriate integer.

(a) T(n)=8T(n/2) + n

(b) T(n)=8T(n/2) + n³

(c) T(n)=3T(n/2) + n

(d) T(n) = T(n/4) + 1

(e) T(n)=3T(n/3) + n²