Question No 1: Give asymptotic upper and lower bounds for T(n) in each of the following recurrences. Assume that T(n) is constant for n s 2. Solve these recursion problems using Substitution method and Recursion Tree. (a) 7(n) = 47 (%) + 5n = (b) T(n) = 257 (1) + n2 = (c) T(n) =T 7(%) + +n = (d) T(n) = 2T = +n (e) T(n) = T(n 1) + log (n)