Under what circumstances are carry save adders more efficient than normal binary adders that take two operands and produce one result? Where, in a typical general-purpose CPU, would one be most likely...

Under what circumstances are carry save adders more efficient than normal binary adders that take two operands and produce one result? Where, in a typical general-purpose CPU, would one be most likely to find carry save adders? Given two 5-bit, signed, twos complement numbers x = –6 = 110102 and y = +5 = 001012, show how their 10-bit product would be computed using Booth’s algorithm (you may wish to refer to Figures 3.26, 3.27, and 3.28).