Hi, could someone help me with this question? Thank you very much!!

Problem 1. Recurrences Karatsuba's algorithm is not the only divide-and-conquer algorithm for integer multiplica- tion. There are, in fact, algorithms that can multiply n-digit numbers recursively by solving: 1. 3 multiplications each of ?-digit numbers (Karatsuba's Algorithm), 2, 5 multiplications each of -digit numbers, 3, 7 multiplications each off-digit numbers, or 4. 9 multiplications each of j-digit numbers, and then doing O(n) work to combine the solutions. Determine the asymptotic running time of each of these four algorithms and rank them irn ascending order of their asymptotic running time. You do not need to justify your answers. Solution