Question 2: Solve the following recurrences using the unfolding method we have seen in class. In each case, give the final answer using Big-O notation. (2.1) if n =1, T(n) = 1+2T(n/3) if n > 3. 3 You may assume that n is a power of 3. (2.2) if n = 1, T(n) = 1+2T(n-1) if n > 2. {1+2:T(1/3 (2.3) 1 if n = 2, T(n) = 1+T(vn) if n > 4. You may assume that n is a power of a power of 2, so that log log n is an integer. ={1+2.7(n-1 ) + {1+76