the following operation: write the operand as 4-bit 2's complement binary numbers, perform the process shown, show all work in binary operating on 4-bit numbers, and •   identify overflow if necessary 2 - 4

in ASM (Irvine 32) write a code that solves  R = (A % B) % (C % D). Note that ABC are 8 bit signed integers and % is the operator modulo  which holds the division operation remainder.

Using bitwise operators, what would be the best way to multiply/divide 208 and 416.Show your steps clearly to receive credit. Also, express your solution in C logic. You donot need to write the whole code.  you may utilize addition and subtractionoperations. However, majority of the computations must be done using bitwise operations.

Question 1. and {C,D} form the two 2-bit numbers N1 and N2. The circuit will perform the difference N1 – N2 and gives output bits F (MSB) and G. Assume that the circuit never sees the combinations of inputs in which N1 is less than N2 i.e. you can regard those input combinations as don't care Consider a 2-bit binary subtractor defined as follows. The inputs {A,B} conditions. а. Fill in the truth table for F and G. b. Fill in the K-map for the minimum sum of products expressions for the function F and G.

a) 1B48 + 39E1