Suppose you are choosing between the following 3 algorithms

Algorithm A solves problems by dividing them into 3 subproblems of half size and then calling itself to solve each subproblem and combining the solution in linear time.

Algorithm B solves problems by dividing them into 4 subproblems of size 14 of the original and solving them with a different function that computes in quadratic time and combining the solution in linear time.

Algorithm C solves the problem by dividing them into 2 subproblems of half size and then calling itself to solve each subproblem and combining the solution in linear time.

a.) What recurrence represents run-time of each algorithm?
b.) Order the algorithms by their big-O from asymptotically smallest to largest, explain your reasoning. i. e. in order of their big-O