Q4: Build a recursion tree for the following recurrence equation and then solve for T(n). (Total: 6*5 = 30 Pts) 6 Pts for each Question. I. T(1) = 1 T(n)= 1 + T(n-1) for n>1 II. T(1)= 1 T(n)= n + T(n-1) for n>1 III. T(1) = 1 T(n) = n + 2T(n/4) for n>1 IV. T(1) = 1 T(n)= n + 2T(n/4) for n>1 = V. T(1) = 1 T(n) = 1 + 2T(n/4) for n>1 Q6: Rank the following complexities in increasing order. (10 Pts.) O(1), o(logn), Onlogn), Onk), O(2^n), On!)