Question 3: Using a table similar to that shown in following, calculate the product of the hexadecimal unsigned 8-bit integers 62 and 12. You should show the contents of each register on each step. Iteration Step 0 1 2 Initial values 1a: 1 = Prod = Prod + Mcand 2: Shift left Multiplicand 3: Shift right Multiplier 1a: 1 Prod = Prod + Mcand 2: Shift left Multiplicand 3: Shift right Multiplier 1:03 No operation 2: Shift left Multiplicand 3: Shift right Multiplier 1:03 No operation 2: Shift left Multiplicand 3: Shift right Multiplier Multiplier 0011 0011 0011 0001 0001 0001 0000 0000 0000 0000 0000 0000 0000 Multiplicand 0000 0010 0000 0010 0000 0100 0000 0100 0000 0100 0000 1000 0000 1000 0000 1000 0001 0000 0001 0000 0001 0000 0010 0000 0010 0000 Product 0000 0000 0000 0010 0000 0010 0000 0010 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 3 4 FIGURE 3.6 Multiply example using algorithm in Figure 3.4. The bit examined to determine the next step is circled in color. Question 3: Using a table similar to that shown in following, calculate the product of the hexadecimal unsigned 8-bit integers 62 and 12. You should show the contents of each register on each step. Iteration Step 0 1 2 Initial values 1a: 1 = Prod = Prod + Mcand 2: Shift left Multiplicand 3: Shift right Multiplier 1a: 1 Prod = Prod + Mcand 2: Shift left Multiplicand 3: Shift right Multiplier 1:03 No operation 2: Shift left Multiplicand 3: Shift right Multiplier 1:03 No operation 2: Shift left Multiplicand 3: Shift right Multiplier Multiplier 0011 0011 0011 0001 0001 0001 0000 0000 0000 0000 0000 0000 0000 Multiplicand 0000 0010 0000 0010 0000 0100 0000 0100 0000 0100 0000 1000 0000 1000 0000 1000 0001 0000 0001 0000 0001 0000 0010 0000 0010 0000 Product 0000 0000 0000 0010 0000 0010 0000 0010 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 3 4 FIGURE 3.6 Multiply example using algorithm in Figure 3.4. The bit examined to determine the next step is circled in color