(Analysis of algorithms) Suppose that you must choose one between the following three algorithms for the same problem P, whose input has size (n), using divide-and-conquer technique:

(i) Algorithm A solves P by deriving from it 4 subproblems of size n / 2, solving them recursively, and then combining their solutions in time (n).

(ii) Algorithm B solves P by recursively solving 2 subproblems of size n-4 and then combining their solutions in time O(1).

(iii) Algorithm C solves P by deriving from it 2 subproblems of size n / 2, solving them recursively and then combining their solutions in time (n).

Which one would you choose? Justify your answer.