Answer Happy

Bit 7 Suppose 6116-5816 is computed using the borrow-method on the binary numbers that are equivalent to the given hexadecimal operands(i.e. The two hexadecimal numbers are converted to binary then the borrow method of subtraction is applied). Assume that in the presentation of binary sting, the first bit from the right is bit-0, 2nd bit from the right is bit-1, etc. (Hint: Refer to notes on the Borrow method for binary number subtraction) Bit 6 d. Bit 5 *** Bit 4 Bit 3 Bit 2 a. Which bit will be the first to perform a borrow-1 operation?... A. bit-3 B. bit-4 C. bit-5 D. bit-6 b. ...and where will this 1-bit be borrowed from? ... A. bit-3 B. bit-4 C. bit-5 c. ... and which bit will perform the second borrow-1 operation?... A. bit-3 B. bit-4 C. bit-5 and where will this 1-bit be borrowed from? ... A. bit-3 B. bit-4 C. bit-5 e. ... and what is the computed difference in decimal notation? A. 3 B. 6 C. 9 D. bit-6 D. bit-6 D. bit-6 Bit 1 D. 12 E. N/A E. N/A E. N/A E. N/A E. N/A Bit 0