Problem 6 (10 points) The ALU supported set on less than using just the sign bit of the adder, as shown in Fig. B.5.10 on page B-33. Let's try a set on less than operation using the values and 6rn. To make it simpler to follow the example, let's limit the binary representations to 4 bits: 1001 wo and 0110wo 100 ltwo - 01 10two-1001 two +1010two-001 1two This result would suggest that -7em>6n, which is clearly wrong. Hence, we must factor in overflow in the decision. Explain what change must be made and then modify the 1-bit ALU in Figure B.5.10 on page B-33 to handle the set on less than correctly. Make your changes on a photocopy of this figure to save time, which is also given below Ainvert Operation Binvert Carryln Result 2 Less 3 Set Overflow detection Overflow Problem 6 (10 points) The ALU supported set on less than using just the sign bit of the adder, as shown in Fig. B.5.10 on page B-33. Let's try a set on less than operation using the values and 6rn. To make it simpler to follow the example, let's limit the binary representations to 4 bits: 1001 wo and 0110wo 100 ltwo - 01 10two-1001 two +1010two-001 1two This result would suggest that -7em>6n, which is clearly wrong. Hence, we must factor in overflow in the decision. Explain what change must be made and then modify the 1-bit ALU in Figure B.5.10 on page B-33 to handle the set on less than correctly. Make your changes on a photocopy of this figure to save time, which is also given below Ainvert Operation Binvert Carryln Result 2 Less 3 Set Overflow detection Overflow