A character representing a digit, n, is stored as an 8-bit ASCII code. It needs to be converted into an 8 bit sign-magnitude representation for the negative numerical value, -n. What is the algorithm for doing this?
Select one:
a. Subtract 00110000 from the ASCII code
b. Subtract 00110000 from the ASCII code and add 1000 0000
c. Subtract 00110000 from the ASCII code and add 100 0000
d. Subtract 00110000 from the ASCII code and flip the rightmost bit.