Please write a full answer, and give a good explanation

1 You are to choose between three algorithms for a particular problem with input size n: Algorithm A solves the problem by breaking it up into five subproblems of size n/2, solving each one of them recursively, and then combines the solutions in linear time. Algorithm B solves the problem by solving recursively two subproblems of size n-1, and then combines the solutions in constant time. Algorithm C solves the problem by breaking it up into nine subproblems of size n/3, solving each of them recursively, and then combines the solutions in O(n) time. Show a closed form for the time complexity of the three algorithms in big-O notation. Indicate which algorithm has the best time complexity, and which one has the worst time complexity