2. (20 points) IP protocol uses l's complement for IP header checksums. Suppose you have the following three 16-bit words: 0101011001100011, 1110001 100000110, 0111001010101100. What is the 1's complement of the sum of these 16-bit words? Show all work step by step in the worksheet given below. Note: first find sum of first two words, then find sum of that and the 3rd word, then find its 1's complement. Why is it that IP takes the 1's complement of the sum; that is, why not just use the sum? (2 points) With the l's complement scheme, how does the receiver detect errors? (4 points) Is it possible that a 1-bit error (one bit is flipped) will go undetected? If yes, give an example.(4 points) How about a 2-bit error? If yes, give an example.(4 points) 0101011001100011 (1st word) : 1 1 1()()()1 1 )()()()()1 10 (7m1 word) +1 (if required) 2 points) 0111001010101100 (3rd word) +1 (if required 2 points) (I's complement) 2 points)