4. (7 marks) (Adapted from Dasgupta et al., Question 2.4) Suppose you are choosing between the following three algorithms: Algorithm A solves problems of size n by recursively solving three subproblems of size n/2, and then combining the solutions in quadratic (O(n?)) time. Algorithm B solves problems of size n by recursively solving three subproblems of size n/3, and then combining the solutions in linear (O(n)) time. Algorithm C solves problems of size n by recursively solving nine subproblems of size n/3, and then combining the solutions in constant (O(1)) time. What are the running times of each of these algorithms (in big-O notation) and which would you choose? [Note: You may use the Master Theorem to explain your answers for this question.]