Assignment task: Suppose you need to choose between the following algorithms which solves the same problem
(a) Algorithm A solves the problem by dividing it into 5 subproblems of half of the size, recursively solves each of them, and combines the solution in linear time.
(b) Algorithm B solves the problem of size n by recursively solving two subproblems of size n - 5 and then combining the solutions in constant time.
(c) Algorithm C solves the problem of size n by dividing it into 9 subproblems of size n/3 each, recursively solving each of them, and then combining the solution in O(n2) time