Question

Suppose you are choosing between the following three algorithms, all of which have 0(1) base cases for size 1:

1. Algorithm A solves problems by dividing them into five subproblems of half the size, recursively solving each subproblem, and then combining the solutions in linear time.

2. Algorithm B solves problems of size n by recursively solving one subproblem of size n/2, one subproblem of size 2n/3, and one subproblem of size