Can someone please answer the multiple choice questions above?

Consider a recursion tree that looks like this: n (n/2)2 (n/2) (n72) (n4)2 (n4)2 (n/4)2 (n4)? (n/4)2 (n/4)2 (n4)? (n/4)2 (n/4)2 1.Suppose this tree is generated by the recurrence relation T(n) = aT(n/b) + nk. 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) log2(n) 3. How many leaves would there be in this tree, as a function of n? Pick the best answer. a) n2 b) n c) nlog23 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