UDP and TCP use $1$s complement for their checksums. Suppose you have the following three $8-$bit bytes: $01011011,01100110,01110100.$ Note that although UDP and TCP use $16-$bit words in computing the checksum, for this problem you are being asked to consider $8-$bit sums.

What is the sum of these $8-$bit bytes? $($result is in $8-$bit$)$

What is the $1$s complement of the sum of these $8-$bit bytes?

With the $1$s complement scheme, how does the receiver detect errors?

Is it possible that a $1-$bit error will go undetected? $($Yes or No$)$

Is it possible that a $2-$bit error will go undetected? $($Yes or No$)$