CS Algorithms:

Q:

***Correct answer will receive a upvote, wrong answer will receive a downvote. Thank you!

3. (10 Points) Suppose you are choosing between the following three algorithms: - Algorithm A solves problems by dividing them into five subproblems of size n/4, recursively solving each subproblem, and then combining the solutions in linear time. - Algorithm B solves problems of size n by recursively solving one subproblem of size n and then combining the solution in constant time. Algorithm C solves problems of size n by recursively solving one subproblem of size n1 and then combining the solution in O(cn) time, where c>1 is a constant. What are the running times of each of these algorithms (in big- O notation), and which would you choose