Suppose you are choosing between the following three algorithms: (A1) Algorithm A solves problems by dividing them into five sub-problems of half the size, recursively solving each sub- problem, and then combining the solutions in linear time. (A2) Algorithm B solves problems of size n by recursively solving two sub-problems of size n - 1 and then combining the solutions in constant time. (A3) Algorithm C solves problems of size n by dividing them into nine sub-problems of size n/3, recursively solving each sub-problem, and then combining the solutions in O(n2) time. What are the running times of each of these algorithms (in big-O notation), and which would you choose