We know that, using Karatsuba algorithm, it takes worst time complexity O(n 1.59) to multiply two bit strings with length n. Suppose that I want to multiply n bit strings _1, , _n, each of which is with length n. I do this by the following betterKaratsuba algorithm. I first divide the n bit strings into two groups, each of which has roughly n 2 bit strings. Then run betterKaratsuba on each group (when the group has only one bit string, betterKaratsuba simply returns the bit string). Then, we use Karatsuba on the results of betterKaratsuba for the two groups. Compute the worst-case complexity of betterKaratsuba.