There is a full example of a correct answer at the bottom. I need to replicate it using different numbers. Thank you!

A full example of Booth's Integer Multiplication Algorithm using two 5-bit, 2's complement signed operands, as follows:

• Start with two signed decimal numbers and identify the multiplicand (first operand) and multiplier (second operand)
• Convert both numbers to 5-bit 2's complement binary representations
• Perform Booth's algorithm. Be sure to label each pass, and for each pass show:
  • The arithmetic step
    • Which arithmetic operation will be applied
    • When needing to add or subtract, show what exact bits you are adding or subtracting and the result
    • The product after inserting the result
  • The arithmetic right shift step
• After determining the final product, prove your result is correct by converting the binary result back to decimal

---------------example-----------------------

3 x 5 multiplicand 3: 00011 multiplier 5: 00101 -3: 11101 (to make subtraction easier) Step LSB Iteration 0 0 0 0 1 1 1a 1b 2a 1 2 1 2 2b 0 Product 00000 00101 (00000+11101)=11101 00101 11110 10010 (11110+00011)=00001 10010 00000 11001 (00000+11101)=11101 11001 11110 11100 (11110+00011)=00001 11100 00000 11110 00000 11110 00000 01111 Description Initialize Subtraction Shift Add Shift Subtraction Shift Add Shift no-op Shift 3 0 3 3b 1 4 1 0 4 5 4a 4b 5a 5b 0 5 0 Conversion 0 x 2 + 0 x 28 + 0 x 27 + 0 x 26 +0 x 25 + 0 x 24 +1x 23 +1x 22 +1x21+1 x 20 + 0 + 0 + 0 + 0 + 0 + 0 + 8 +4+2 +1 = 15