Then-bit two's complement integer N is written a_n-1, a_n-2, ,,, a₁, a₀• Prove that (in two's complement notation) the representation of a signed binary number in n + 1 bits may be derived from its representation in n bits by repeating the leftmost bit. For example, if n = - 12 = 10100 in five bits or n = - 12 = 110100 in six bits.