Consider algorithm solve given below. This algorithm solves problem P by finding the output (solution) O corresponding to any input I. Assume g(n) basic operations for partitioning and combining and no basic operations for an instance of size 1. Write a recurrence equation T (n) for the number of basic operations needed to solve P when the input size is n. What is the solution to this recurrence equation if g(n) theta(n)? (Proof is not required.)