$4-5-$ Suppose Algorithm X operates on linear arrays. Suppose that if the array has length one, then Algorithm X returns an answer with a constant amount of work. Otherwise, Algorithm X calls itself recursively three times on linear arrays that are $3/4$ as long, and in doing so performs a linear amount of work creating the subproblems and combining their solutions. That is$,$ the work performed in creating the subproblems and combining their solutions is proportional to the number of elements in the array. Write down a recurrence for the running time of Algorithm X and solve it$.$