Can someone please answer the multiple choice questions above?

Now consider a recursion tree that looks like this: Nous contide a reunion tres that looks like this (2n/3) (2n/3) (4n/9) (4n/9) (4n/9) (4n/9) ... ... ... ... ... ... ... ... 5. 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. -- 6. Roughly how many levels would there be in this tree, as a function of n? Pick the best answer. a) na b) 2n Cn 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) n3/2 b) n c) n1093/22 d) log3/2n 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 4n1093/22 for large n. c) T(n) is about n2 for large n d) T(n) is about log3/2n for large n