1. Part A. (10 marks) Suppose A-E5 and B SE (both in hexadecimal). (both in hexadecimal). Show the step by step result multiplying A and B, using Booth's algorithm. Assume A and B are 8-bit two's complement integers, stored in hexadecimal format. Part B. (14 marks) Describe in one paragraph with your own words why Booth's algorithm works. Also, what does the mythical bit in Booth's algorithm stand for? Sketch/justify why it is needed and why it works. Part C. (3 marks). What is the MIPS command that gives the upper 32 bits of the above multiplication of signed integers? Name one register where you will be placing the result and fill in all 32 bit positions for this instruction (write it both in assembly and in machine language) Solution