Question 1 (5 marks) (Exercise 2.4 of DPU textbook): Suppose you are choosing between the following three algorithms: Algl solves problems by dividing them into five sub-problems of half the size, recursively solve each sub-problem, and then combining the solutions in linear time. Alg2 solves problems of size n by recursively solving two sub-problems of size (n 1) and then combinig the solution in constant time. Alg3 solves problems of size n by dividing them into 7 sub-problems of size n/3, recursively solve each sub-problem, and then combining the solutions in O(n^). By comparing the running time of these three algorithms (in big-O notation), which one you choose? Why