<Li> P = 0 0000 0010 0 . The last two bits are 00 . <Ul> <Li> P = 0 0000 0001 0 . Right shift . </Li> </Ul> </Li> <Ul> <Li> P = 0 0000 0001 0 . Right shift . </Li> </Ul> <Li> P = 0 0000 0001 0 . Right shift . </Li> <Li> P = 0 0000 0001 0 . The last two bits are 10 . <Ul> <Li> P = 0 1000 0001 0 . P = P + S . </Li> <Li> P = 0 0100 0000 1 . Right shift . </Li> </Ul> </Li>

Explain booth's algorithm for two complement multiplication