For each of the following code snippets, find the asymptotic running time (i.e. Theta). Justify your answer using either the substitution method or recursion trees. For each of these, let T(0) = T(1) = 1. (a) T(n) = T(n/2) + 5. (b) T(n) = T (n/2) + n. (c) T(n) = 2 middot T (n/2) + 10. (d) T(n) = 3 middot T(n/3) + n. (e) T(n) = 5middot T(n/2). (f) T(n) = T(n - 1) + 1. (g) T(n) = T(n - 2) + 3n. (h) T(n) = T(n - 1) + n^2