In this project, you are required to perform a complete run of Booth's algorithm on two
16-bit signed numbers. The generation steps for the two numbers are described as follows.
1- Assume that the numerical part of your student ID is A.
2- The square of A is B (B = A2). Use binary representation to represent B.
3- Right shift B for 16 bits, take the lower 15 bits, and append an extra bit '0' to the most significant bit (MSB) to form a new 16-bit number C. (i.e., C is a positive number.)
4- Right shift B for 16 bits, take the lower 15 bits, and append an extra bit '1' to the most significant bit (MSB) to form a new 16-bit number D. (i.e., D is a negative number.)
5- Perform C×D by using the Booth's algorithm.
