Compare and contrast the third multiplication algorithm with Booth's Algorithm for the following 8-bit numbers. Use A = (01111011)2 for the multiplier and B = (0010 0010)_2 for the multiplicand. Determine AxB using each algorithm. Which algorithm uses more arithmetic operations? Which algorithm is more efficient for AxB? Recall that shifts are more efficient than adds