Can you explain each algorithm and why would you choose the you choose?

4.) Divide and Conquer Suppose you are choosing between the following three algorithms: . Algorithm A solves problems by dividing them into five subproblems of half the size, recur . Algorithm B solves problems of size n by recursively solving two subproblems of size n -1 . Algorithm C solves problems of size n by dividing them into nine subproblems of size n/3, What are the running times of each of these algorithms (in big-O notation), and which would you sively solving each subproblem, and then combining the solutions in linear time and then combining the solutions in constant time. recursively solving each subproblem, and then combining the solutions in O(n2) time. choose