1. Find the 16-bit computer representation of -2542. 2. Perform the calculations 347245767 in BCD arithmetic. 3. Write a recursive algorithm of the sequence t(1)=-2 and t(n)=nt(n-1) as a function. questions to gain marks for weekly assessment) Further Exercises (Questions for weekly assessment) 1. Find the 16-bit computer representation of -2542. 2. Perform the calculations 3472+5767 in BCD arithmetic. 3. Write a recursive algorithm of the sequence t(1)=-2 and t(n)=nt(n-1) as a function Further Exercises (Questions for weekly assessment) 1. Find the 16-bit computer representation of -2542. 2. Perform the calculations 3472+5767 in BCD arithmetic. 3. Write a recursive algorithm of the sequence t(1)=-2 and t(n)=n?t(n-1) as a function. his