Please help with a problem on Algorithm!!!! Please show all works!!!

Thanks

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