For each of following Divide and Conquer algorithms, state the corresponding recurrence relation, and state a runtime bound (using O) (you do not need to show work for solving the runtime recurrence).
A. If you solve 7 sub-problems of size n /7 , then the cost of combining the solutions of the sub-problems to obtain a solution for the original problem is 3n + 20
B. If you solve 16 sub-problems of size n/ 4 , then the cost for combining the solutions is 100
Leave an answer