If you could give some insight, thanks!

(30 points) Implement the long-hand multiplication algorithm for two n-bit unsigned numbers, with no recursion, no divide-and-conquer, etc. Note that you need to multiply bitstrings not integers, and the return value of your program should also be a bitstring. E.g., x=11110000,y=10111100, then if z=xy, your program should return z=1011000001000000. The truth tables for binary multiplication and binary addition are given in Table 1 and Table 2 , for your reference