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