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.

Hint. The bitstring is a simple string with many 0s and 1s, you need to parse the input strings x and y as boolean arrays, with the lsb at index 0 of array. Output z should also be stored in a boolean array.

Language- Java