Algorithm ONE solves an instance of size n by recursively calling eight instances of size n$/2,$ then it combines their solutions in time O$($n$3).$ What is Algorithm ONE$$s running time?

$($b$)(3$ points$)$ Algorithm TWO solves an instance of size n by recursively calling twenty instances of size n$/3,$ then it combines their solutions in time O$($n$2).$ What is Algorithm TWO$$s running time?

$($c$)(2$ points$)$ Algorithm THREE solves an instance of size n by recursively calling two instances of size $2$n$,$ then it combines their solutions in time O$($n$).$ What is Algorithm THREE$$s running time?

$($d$)(2$ points$)$ Which of the three algorithms above is preferable, and why?