1. Suppose a Divide-and-Conquer solution to a problem recursively divides it into two smaller problems. One sub-problem uses one-half of the inputs and the other sub-problem uses two-thirds of the inputs. Suppose the divide and combine operations take linear time. Write a recurrence equation for the running time T(n) of this algorithm. Assume T(n) is constant for small n. (Do not solve the recurrence.)