Algorithm A solves an instance of size n by recursively solving eight instances of size n/2, and then combining their solutions in time O(n3).

Algorithm B solves an instance of size n by recursively solving twenty instances of size n/3, and then combining their solutions in time O(n2).

Algorithm C solves an instance of size n by recursively solving two in- stances of size 2n, and then combining their solutions in time O(n).

Which algorithm is preferable, and why?