Internet Checksum (b). Consider the two sixteen bit numbers:10110100 0100011011001000 01101110Compute the Internet Checksum of these two valuesEnter the 2 bytes each as an 8-bit number with only 0’s and 1’s, and make a single blank space between the two 8-bit numbers (e.g., 01010101 00101000).

Computing the Internet Checksum (2). Compute the Internet checksum value for these two 16-bit words: 01000001 11000100 and 00100000 00101011[Note: you can find more problems like this one hereLinks to an external site..]Group of answer choices10011110 0001000110011110 0001000010011110 00001111 01101110 11010101

The Internet checksum, used by IP, TCP and UDP, is formed by taking the ________ of the 16-bit words of the message:Question 14Select one:a.two’s complement sumb.one’s complement sumc.logical XORd.logical ORe.logical AND

Assume that the UDP system on your computer received a datagram whose header contains Source Port #9568, Dest Port #21932, Length of 12, and a payload containing 0x9CBD 0x0085. What value should be in the checksum field?Group of answer choices0001100001011011100111010100001011100111101001000001100001011011

Internet Protocol addresses consist of which of the following? Choose one.Choose one answer.Two octets (8-bits), each between 0 and 240.Six octets (4-bits), each between 0 and 260.Four octets (4-bits), each between 0 and 225.Four octets (8-bits), each between 0 and 255.

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.