Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. If you have understood Booths's algorithm, this question here asks for the Booth's recording of the multiplier(-72).
2's complement of -72 is 1011 1000.
Now we append a 0 at the LSB and start from right end taking pairs of two symbols which are encoded as:
1 0 1 1 1 0 0 0 0
-1 +1 0 0 -1 0 0 0
Hence option D.
