Suppose you are choosing between the following two divide$-$and$-$conquer

algorithms for a particular problem.

Algorithm A solves problems of size $n$ by dividing them into five subproblems

of size $\frac{n}{2},$ recursively solving each subproblem, and then combining the five

solutions in linear time.

Algorithm B solves problems of size $n$ by dividing them into nine subproblems

of size $\frac{n}{3},$ recursively solving nine subproblems, and then combining the

solutions in cubic time.

Which one among the above two is asymptotically faster?

Both have the same runtime when expressed using Big$-$Oh notation

B

A