Implement an algorithm to multiply two integers given in the binary position sys

Long multiplication in pseudocode would look something like:

ID: 3542455 • Letter: I

Question

Implement an algorithm to multiply two integers given in the binary position system.

The integers should be represented as vectors of digits.

For the experiments use randomly generated numbers with n binary digits (you will need to design

and iplement a procedure to generate such numbers) and range n over n = 50; 100; 200; 400; 800; 1600

(note that the values of n in this sequence double each time we move on to the next element). What is

the theoretical bound for the number of basic operations?

Any idea how to solve this?

Long multiplication in pseudocode would look something like:

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.