4. Using 8-bit 2's compliment number, add 14 and 29 together, then verify the result. 5. For a "word" of 3 bits, make a table that lists all the signed binary numbers representable by the following systems plus their corresponding decimal equivalence: Note: we discussed 4-bit word representations in the lecture. a) Signed magnitude b) One's complement c) Two's complement d) Excess-3 6. Perform the following binary multiplications using Booth's algorithm, assuming signed two's complement integers: a) 1011 b) 0011 c) 1011 1100010 1011