Can somebody please go through these questions?

Consider a recursion tree that looks like this: n2 (n/22 (n/2) (n/2) (14)* (14) (14) (1/4)2 (1/4) (/4) (1/4) (14) (1/4)* 1. Suppose this tree is generated by the recurrence relation T(n) = aT(n/6) + n. a) Give a non-negative integer or rational number for a. ---- b) Give a non-negative integer or rational number for b... c) Give a non-negative integer or rational number for k. ----- 2. Roughly (to within +/-1) how many levels would there be in this tree, as a function of n? Pick the best answer. a) na b) 2n c) n d) log(n) 3. How many leaves would there be in this tree, as a function of n? Pick the best answer. a) na b) n c) nalog23 d) logan 4. Solve the recurrence to obtain an asymptotic expression for T(n) as a function of n. Pick the best answer. a) T(n) is about 2" for large n. b) T(n) is about 4n2 for large n. c) T(n) is about n2 for large n d) T(n) is about logan for large n. Now consider a recursion tree that looks like this: n (2n/3) (40/9) (4n/9) (21/3) (4n/9) (40/9) 5.Suppose this tree is generated by the recurrence relation T(n) = aT(n/6) + n. a) Give a non-negative integer or rational number for a. ----- b) Give a non-negative integer or rational number for b. ----- c) Give a non-negative integer or rational number for k. ----- 6. Roughly how many levels would there be in this tree, as a function of n? Pick the best answer. a) na b) 2n c) n d) log(3/2)(n) 7. How many leaves would there be in this tree, as a function of n? Pick the best answer. a) 3/2 b) n c) nlogs/22 d) logs/27 8. Solve the recurrence to obtain an asymptotic expression for T(n) as a function of n. Pick the best answer. a) T(n) is about (3/2)" for large n. b) T(n) is about 4n lang/22 for large n. c) T(n) is about na for large n d) T(n) is about logs/2n for large n