Hello, I'm having trouble getting the correct answer for this question. Could someone take a look at where I messed up in the question because I am unable to find it. This question uses Booth's algorithm. Thanks in advance.

5. A Multiply the following two signed numbers using Booth's a lgorithm 10100110 01110110 A (Multiplier) 10100 110 B (Multiplicand) 3 01110 110 10 001 010 Product Iteration Step Action Initialize 0000 0000 1010 0110 0 1.00 No action Shift 0000 0000 0101 0011 0 subtract 1.10 1000 1010 0101 0011 0 Shift 1100 0101 0010 1001 1 No action 1110 0010 1001 0100 1 Shift 1.01 0101 1000 1001 0100 1 Add Shift 0010 1100 0100 1010 0 No action 1.00 Shift 0001 0110 0010 0101 0 1.10 1010 0000 0101 0 subtract 1101 0000 0001 0010 1 Shift 1.01 0100 0110 0001 0010 1 Add Shift 0010 0011 0000 1001 0 1.10 1010 1101 0000 1001 0 tract 1101 0110 1000 0100 1 AxB 1101 0110 1000 0100 Correct Answer SHOULD BE (0100 1100 1000 0100) 2