implement the divide-and-conquer recursive method in java using arity (branching factor) of 3. You should not assume the number of bits is always even. You will need to take care of this carefully in implementing the algorithm outlined in the book.

A divide-and-conquer algorithm for integer multiplication.

function multiply(x, y) Input: n-bit positive integers x and y

Output: Their product

if n = 1: return xy xL,

xR = leftmost n/2, rightmost n/2 bits of x yL, yR = leftmost n/2, rightmost n/2 bits of y

P1 =multiply(xL,yL)

P2 =multiply(xR,yR)

P3 =multiply(xL +xR,yL +yR)

return P1 2n +(P3 P1 P2)2n/2 + P2