The O(nlog2 3) divide-and-conquer algorithm for integer multiplication worked by splitting the bits of the input integers into 2 halves, performing 3 recursive calls, and doing some constant number of integer additions and bit shifts. There's a slightly better algorithm that splits the bits of the input integers into 3 thirds, performs 5 recursive calls, and does a constant number of additions and bit shifts. Prove that the bit-wise running time of this algorithm is O(nlos6)./l Master theorenm