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