Problem 4. (25 points) Suppose that we have designed three divide-and-conquer algorithms that solve a particu- lar problem, where the input size is n. The first one solves four subproblems of size n/2 and the cost of combining the solutions of the subproblems to obtain a solution for the original problem is n2. The second solves three subproblems of size n/2 and requires n2 Vn time for combining the solutions. The third solves five subproblems of size n/2 and requires n logn time for combining the solutions. Assume that all three take (1) when n- 1. Which algorithm would you choose and why? Show your work using the Master method