Let us say we are given 2 binary strings of n-bits each which represent the values
of two integers. We wish to calculate the product of these 2 integers. Using Divide
and Conquer approach we can reduce the number of intermediate products in the
each step by 1. In general, if the number of splits in each step is k, then what is the
time complexity for calculating the product of the 2 integers?
