2. Use recursion trees to asymptotically solve the recurrences below. (Assume that in each case, for sufficiently small values of n the value of the function is constant.) You are encouraged to draw pictures of the recursion trees, but you do not need to submit them. However, you must describe the depth of each recursion tree and the total amount of work done at each of its levels: - A(n)=3A(n/4)+n2 B(n)=B(n1)+n2 - C(n)=C(n/4)+C(n/3)+C(n/6)+2C(n/8)+3n - D(n)=2D(n1)+5