Answer as many as you can please. Any help is appreciated!

Perform the following operations on 8-bit unsigned numbers and indicate possible overflow (10 points) 1. a) 10110100-01110111 b) 00111000+11001101 c) 10001011+01110100 d) 01110100-10001011 2. Perform the following operations on 8-bit two's complement numbers and indicate possible overflow (10 points): a) 10110100-01110111 b) 00111000 11001101 c) 10001011+01110100 d) 01110100 10001011 3. Given the RTL code for the shift-add multiplication algorithm: Si YO S2: S2 S3: Z S3: Z S3: Show the trace for UV-X*Y, where X 1001 and Y-1110 (10 points). CU-_UtX i1-1 shr(CUV), cir(Y) S2-_-1 Finish-1 Given the RTL code for the shit-subtract division algorithm: G SI: S2 S3 4. Finish-1, Overflow1 Y--0, C 0, i-n. Overflow--0 shl(CUV), shl(Y), i-i-1 Z' S4: go to S3 Finish-1 Show the trace for Y-UVIX, where UV-01101011 and X-1010 (10 points). Given the RTL code for the signed-magnitude addition/subtraction algorithm PM' S1: PM S1: PM' S2: s. CU-X+Y+1, Overflow-0 OverflowC Ust-XS CZ, PM S2: S2 Show the trace for the following operations (10 points): Finish-1 a) XsX-00111, YsY 11001, UsU-XsX+YsY b) XsX-00111, YsY 11001, UsU-XsX-YsY c) XsX-10111, YsY-01001, UsU-XsX+YsY d) XsX-10111, YsY-01001, UsU-XsX-YsY