Please implement the algorithm above in python. The code below doesn't work for for values that are more than 1 bit. Please help fix that, thanks

function multiply (x,y) Input: Positive integers x and y, in binary Output: Their product n=max( size of x, size of y ) if n=1 : return xy xL,xR= leftmost n/2, rightmost n/2 bits of x yL,yR=leftmostn/2, rightmost n/2 bits of y P1=multiply(xL,yL) P2=multiply(xR,yR) P3=multiply(xL+xR,yL+yR) return P12n+(P3P1P2)2n/2+P2