I'm having a lot of trouble understanding where the 3/4's comes from in the explanation portion of part b. You can ignore part A I would just like an explanation of how part b works, such as how exactly we get 3/4s a from then on.

+n2 Problem 3 (12 points) a) Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n) = T("/ Hint: when |x|