Using binary integer arithmetic

Question 1 6 pts Suppose A = 1110 and B = 0100. Calculate A+B and state whether or not overflow has occurred. All values should be expressed in 4-bit 2's complement binary. A+B = 010010 Overflow = yes (yeso) Question 2 6 pts Suppose A = 0011 and B = 0101. Calculate A-B and state whether or not overflow has occurred. All values should be expressed in 4-bit 2's complement binary. A-B = -10 Overflow = no (yeso) Suppose A = (1111 1110)2 and B = (0001 0000)2. Determine AxB using Booth's algorithm if A is the multiplier and B is the multiplicand. Multiplicand: [Select] -Multiplicand: [Select] Multiplier. [Select] Iteration Step Product Previous LSB Action 0 0000 0000 1111 1110 0 Initialize 1 1.00 0000 0000 1111 1110 0 No action 1 1.2 0000 0000 0111 1111 0 Shift Select] V 2 2.10 1111 0000 0111 1111 0 2 2.2 [ Select] 1 Shift 3 3.11 1111 1000 0011 1111 1 No action 3 3.2 1111 1100 0001 1111 1 Shift 4 4.11 1111 1100 0001 1111 1 No action 4 4.2 [Select ] 1 Shift 5 5.11 1111 1110 0000 1111 1 No action 5 5.2 1111 1111 0000 0111 1 Shift 6 6.11 1111 1111 0000 0111 1 No action 6 6.2 1111 1111 1000 0011 1 Shift 7 7.11 1111 1111 1000 0011 0 No action 7 7.2 1111 1111 1100 0001 1 Shift 18 8.11 1111 1111 1100 0001 0 [ Select ] 8 8.2 0 o Shift [Select]