The following two signed 2’s complement numbers (multiplicand \( M \) and multiplier \( Q \)) are being multiplied using Booth’s algorithm:
| Multiplicand (\( M \)) | Multiplier (\( Q \)) |
|---|
| 1100 1101 1110 1101 | 1010 0100 1010 1010 |
|---|
The total number of addition and subtraction operations to be performed is __________. (Answer in integer)