5. (20 pts) Evaluate the following recurrences. Use Master Theorem if applicable. If not - clearly state why and solve the corresponding recurrence using the unfolding method we have seen in class. In each case, give the final answer using Big-O notation (a) (5 pts) T(1)-1, and for n 3: T(n) 1 +2T(n/3). You may assume that n is a power of 3 (b) (5 pts) T(2)-1, and for n 2 4: T(n)-1T(Vn). You may assume that n is a power of a power of 2, so that log log n is an integer. (c) (5 pts) T(1)-1, and for n > 2: T(n)-5T(n/7) + n. You may assume that n = 7k for some k > 0. (d) (5 pts) T(1) 1, and for n2 2, T(n)-T(n -1)+2n