Could use some help with these questions.

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 = Overflow = (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 0 No action 1.00 0000 0000 1111 1110 1.2 0000 0000 0111 1111 0 Shift [ Select] 5 5.11 1111 1110 0000 1111 1 No action 5 5.2 1111 1111 0000 0111 1 Shift 6 1 No action 6 1 Shift 6.11 1111 1111 0000 0111 6.2 1111 1111 1000 0011 7.11 1111 1111 1000 0011 7.2 1111 1111 1100 0001 7 1 No action 1 Shift 00 8.11 1111 1111 1100 0001 1 [ Select]