1) Multiply each of the following pairs of 8-bit numbers using binary representation, Booth's coding and bit-pairing coding of the multiplier: Multiplicand Multiplier A4 7A 7B 6E 2) For each case,compare between the three algorithms in terms of number of additions and shifts needed