Suppose algorithm x operates on linear arrays. suppose that if the array has lengthone, then algorithm x returns an answer with a constant amount ofwork. otherwise, algorithm x calls itself recursively three times on linear arrays that are 2/3 as long, and indoing so performs a linear amount of work creating the subproblems and combining theirsolutions. that is, the work performed in creating the subproblems and combining theirsolutions is proportional to the number of elements in the array. write down a recurrencefor the running time of algorithm x and solve it.