Use 1's complement to compute the following subtractions in parts (a) and (b), show work: a) 1010011-1000011 b)1000101-1010101 c) Use 2's complement to compute the same subtractions in parts (a) and (b), show work: 2's complement system: You are given four signed integers in different number bases A = + (7B)_16 B = -(21)_ C = + (103)_10 D = +(11001)_2 a) What is the value n, the smallest number of bits needed to represent all of these numbers in 2's complement representation? In general, using the value found for n, what is the largest and smallest number that can be represented? b) Give the n-bit representations of the four numbers in the 2's complement system, where n is the value determined in (a). c) Compute using 2's complement arithmetic C+ D. Is this the answer you would expect? Explain