1. (45 points) For the examples below, show how binary multiplication would proceed using (i) the pencil and paper method (the most basic method discussed in class), (ii) the final refined hardware method we discussed in class, and (iii) Booth's Algorithm. For (ii) and (iii), for each step, show what operations are performed in that step, and what the state of the product/multiplier register is at the end of each step. Assume each operand uses four bits. a. (-4x-6) b. 7x9 c. 7x-2