uppose you are choosing between the following two algorithms:

$1.$ Algorithm A solves problems by dividing them into seven subproblems

of quarter the size, recursively solving each subproblem, and then com$-$

bining the solutions in linear time.

$2.$ Algorithm B solves problems of size n by dividing them into nine sub$-$

problems of size n$/3,$ recursively solving each subproblem, and then

combining the solutions in O$($n$2)$ time.

What are the running times of each of these algorithms $($in big$-$O notation$),$

and which would you choose?