7. [10 points] Consider two 4-bit positive integers x- 11 (binary 1011) and y- 13 (binary 1101). Calculate their product x-y recursively, using the divide-and-conquer algorithm shown in our "Functions" slides. The multiply function will be calling itself repeatedly, using smaller-sized inputs you may need to prepend 0 bits to the left to make inputs sizes even (divisible by 2). Show the inputs and the output (in binary format) of every recursive call made to the multiply function, until one of the inputs becomes 0 or 1. 7. [10 points] Consider two 4-bit positive integers x- 11 (binary 1011) and y- 13 (binary 1101). Calculate their product x-y recursively, using the divide-and-conquer algorithm shown in our "Functions" slides. The multiply function will be calling itself repeatedly, using smaller-sized inputs you may need to prepend 0 bits to the left to make inputs sizes even (divisible by 2). Show the inputs and the output (in binary format) of every recursive call made to the multiply function, until one of the inputs becomes 0 or 1