Problem 3. Consider the recurrence n-3t2 + n, for n>1 and n is a power of 2 2 Show that tn2n using induction. Problem 4. Write a recursive algorithm to find the smallest value in an array S of n integers. When designing this algorithm, use the divide-and-conquer approach. This means that your algorithm must 1. divide the array S into two subarrays, 2. find the smallest value of each subarray by using recursion, and 3. compare the smallest values of each subarray to determine the smallest value of the entire array S