Appreciate a detailed working program in python that takes two n-bit digits and multiplies using divide and conquer method. Details below:

Implement the divide-and- conquer algorithm in python using the pseudo code below. Use bit-wise operations for division and shifting, and also for splitting the input numbers into 2 parts. Use regular additions/subtractions on integers for the rest. Do not use any other bitvector/bitarray module. Note that this method recurses on the number of bits which reduce in half each time. You can use the python x bit length() routine to figure out the number of bits it takes to represent a given integer x. Also, add another statement to the base case, i.e., after checking for n 1, add the statement: fx 0 or y and return 0 Pseudocode to be used is given below: Eunction multiply r,y) Input Positive integers z and y, in binary Output Their product max (size of r, size of y) if n 1 return ry zu, TR leftmost In/21, rightmost In/2 bits of z yn, yR leftmost n/21 right most In/2 bits of y multiply(rL, yu) Pr- multiply yR) Ps multiply (zL zR, yR) return Ph x 2" (Ps Pa Pe) x 2n/2 P2