4. (12 points) Suppose there are three options for dividing a problen of size n into subproblems of smaller size: Algorithm A solves the problem by recursively solving eight instances of size n/2, and then combining their solutions in time O(n3) Algorithm B solves the problem by recursively solving twenty instances of size n/3, and then combining their solutions in time O(n2). V Algorithm C solves the problem by recursively solving two instances of size 2n, and then combining their solutions in time O(n) Which one is preferable, and why? A hint: please, think twice before you write something about the algorithm C