For each of the following parts, determine if overflow occurs (assume values are 6-bit fixed-point binary numbers):  0001.01+1001.01   1101.10+1100.01   1000.10+1111.01   0011.10+0100.11   1000.01+0111.11

Overflow occurs if what bits are required to contain the result from an N-bit addition or subtraction

How can you determine whether overflow occurred?

3) Let R1 and R2 be two 4-bit registers that store numbers in 2's complement form. For the operation R1 + R2, which one of the following values of R1 and R2 gives an arithmetic overflow?

A programming language stores integers in a 16-bit two’s-complement representation. Which of the following arithmetic expressions would potentially cause an overflow problem? (You can assume that the operations are completed from left to right.)Question 2Select one:-16,384 + 16,384-32,000 + 32,768 + 32,000-32,000 + 32,000 - 32,76825,000 – (-7,767)

n this challenge, you will use logical bitwise operators. All data is stored in its binary representation. The logical operators, and C language, use to represent true and to represent false. The logical operators compare bits in two numbers and return true or false, or , for each bit compared.Bitwise AND operator & The output of bitwise AND is 1 if the corresponding bits of two operands is 1. If either bit of an operand is 0, the result of corresponding bit is evaluated to 0. It is denoted by &.Bitwise OR operator | The output of bitwise OR is 1 if at least one corresponding bit of two operands is 1. It is denoted by |.Bitwise XOR (exclusive OR) operator ^ The result of bitwise XOR operator is 1 if the corresponding bits of two operands are opposite. It is denoted by .For example, for integers 3 and 5,3 = 00000011 (In Binary)5 = 00000101 (In Binary)AND operation OR operation XOR operation 00000011 00000011 00000011& 00000101 | 00000101 ^ 00000101 ________ ________ ________ 00000001 = 1 00000111 = 7 00000110 = 6You will be given an integer , and a threshold, i1nnik$. Print the results of the and, or and exclusive or comparisons on separate lines, in that order.ExampleThe results of the comparisons are below:a b and or xor1 2 0 3 31 3 1 3 22 3 2 3 1For the and comparison, the maximum is . For the or comparison, none of the values is less than , so the maximum is . For the xor comparison, the maximum value less than is . The function should print:202Function DescriptionComplete the calculate_the_maximum function in the editor below.calculate_the_maximum has the following parameters:int n: the highest number to considerint k: the result of a comparison must be lower than this number to be consideredPrintsPrint the maximum values for the and, or and xor comparisons, each on a separate line.Input FormatThe only line contains space-separated integers, and .ConstraintsSample Input 05 4Sample Output 0233Explanation 0All possible values of and are:The maximum possible value of that is also is , so we print on first line.The maximum possible value of that is also is , so we print on second line.The maximum possible value of that is also is , so we print on third line.