L Number = [L1, L2, L3, L4, L5, L6, L7, L8] Example: L Number=12345678, L1=1, L2=2, L3=3, L4=4, L5=5, L6=6, L7=7, L8=8; Decimal representation L1L2L3 is 123 (One hundred and twenty-three in base 10)

1. Compute the sum of 1000 0000 and the binary output of the following program. Assume the sum is a 2s complement representation and convert it to decimal representation.

int Digit= [L1, L2, L3, L4, L5, L6, L7, L8];

for (i=0; i<8, i++)

{

if Digit [i]>=4

Digit[i]=1;

else

Digit[i]=0;

}

2. Convert decimal representation L7L8 and -60 (negative sixty) to 2s complement representations TC1 and TC2, and subtract TC1 from TC2. Is the result correct or not? Why?