Question 1 (10 points) Answer the following questions: Draw a recursion tree for the recurrence T(n) = T(an) + T(n/a) + cn2, where 0 O are constants. Draw the nodes up to three depths, i.e., level 0, 1 and 2(root node is depth 0). Find the total cost of the entire tree of depth three. b. Assume that the procedure FUN(n) has a running time of O (n), and we have designed an algorithm as follows: SOME-ALGO(n) 1. i= 1 2. while i