Algorithm A solves problems by dividing them into 5 subproblems of half the size of n (a large positive integer in power of 2), recursively solving each subproblem, and then combining the solutions in linear time. (b) Algorithm B solves problems of size n (a large positive integer) by recursively solving 2 subproblems of size n 1 and then combining the solutions in constant time. (c) Algorithm C solves problems of size n (a large positive integer in power of 3) by dividing them into 9 subproblems of size n/3, recursively solving each subproblem, and then combining the solutions in O(n 2 ) time. What are the running times of each of these algorithms (in big-O notation), and which would you choose? We assume T(1) = 1 for all the three algorithms.