One's Complement one to one

2. The one's complement representation of an integer is denned as follows: 0(x)2 ifx>0. (2" - 1)2 ecall that ()2 denotes plain binary representation, and 0 as a prefix stands for an appropriate number of leading zeros to be inserted in order to have a bit string of exact length n A: Show that (0ic is a one-to-one correspondence from the given range of integers to the set of bit strings of length n. Determine the one's complement representation of the integers 0, 1,2-1-1,-1,-2"-1 +1, -2n-1 Attention: this is not! the standard definition of one's complement as you would find it e.g. on Wikipedia. However, it is almost that, with the exception of (-2-1)le which is not defined by the standard concept. That concept therefore does not yield a one-to-one correspondence. B: Work out a formal addition rule +ic for bit strings of length n, together with a rule specifying when the result of the addition is defined, so that for any integers-2n-1 X, y 2n-1: x + y is defined (i.e., falls in the given range) if and only if (x-tu (y)le ls defined (according to your rule), and in that case C: Find an easy way of conversion between the two's complement and the one's complement representation of integers