3. Solve each of the recurrence relations and give bound for each. You can use the master theorem if applicable.

Please answer at least the last 4 (d,e,f,g)

3. Solve each of the recurrence relations and give 0 bound for each. You can use the master theorem if applicable. (a) T(n) = 5T(n/4) + n. (b) T(n) = 7T(n/7) + n. (c) T(n) = 9T(n/4) + n2. (d) T(n) = 8T(n/2) + n. (e) T(n) = 49T(n/25) + n3.5 log n. (f) T(n) =T(Vn) +1. (g) T(n) = T(vn) + log n