Using K-maps, extract the most simplified SOP function for 4-digits binary 2’complementer. The binary function will have 4 inputs and 4 outputs, (e. g. if the input is 0001 the output must be

1111).

a)The inputs ranges from 0000-1111, and you may use A B C D as input digits and S1 S2 S3 S4 as

output digits.

A B C D | S1 S2 S3 S4

0 0 0 0 | 0 0 0 0

0 0 0 1 | 1 1 1 1

………….

1 1 1 1 | 0 0 0 1

b) Draw the circuit. The circuit is a simplified two-level circuit, plus inverters as needed for the

input variables.

This program should be a short piece of code that prints all of the positive integers from 1 to 100 as described more fully below. the program may contain multiple methods, and if using an oo language, should be contained within a single class or object. the program should be designed so that it begins execution when invoked through whichever mechanism is most common for the implementation language. â–ş print out all positive integers from 1 to 100, inclusive and in order. â–ş print messages to standard output, matching the sample output below. â–ş in the output, state whether the each integer is 'odd' or 'even' in the output. â–ş if the number is divisible by three, instead of stating that the number is odd or even, state that the number is 'divisible by three'. â–ş if the number is divisible by both two and three, instead of saying that the number is odd, even or divisible by three; state that the number is 'divisible by two and three'. â–ş design the logic of the loop to be as efficient as possible, using the minimal number of operations to perform the required logic. sample output the number '1' is odd. the number '2' is even. the number '3' is divisible by three. the number '6' is divisible by two and three.