Please follow the prompts and explain the process as to how you worked the problem.

1. (20 pts) Carry out the step-by-step procedure of Booth algorithm in multiplying the two 8-bit 2's-complement numbers: multiplicand (A): 11001101, multiplier (B): 01001101. Note: use B as the multiplier to scan per bit for each cycle. Verify your result and also confirm the correctness of all intermediate results against the 'partial multiplier' used so far. Also give a snapshot of the two registers' value for each cycle after the shift operation is performed. 2. (10 pts) Use a one-step process to add up all partial products for problem 1