Udp and tcp use 1s complement for their checksums. suppose you have the following three 8-bit bytes: 01010011, 01100110, 01110100. what is the 1s complement of the sum of these 8-bit bytes? (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.) show all work. why is it that udp takes the 1s complement of the sum; that is, why not just use the sum? with the 1s complement scheme, how does the receiver detect errors? is it possible that a 1-bit error will go undetected? how about a 2-bit error?

Write a program in plp assembly that counts up by one starting from zero (or one) inside a loop and writes this value to the leds every time the value is increased. the memory address of the leds is 0xf0200000. the table below shows the meaning and an example usage of the instructions covered in the video, plp instructions for project 1. instruction example usage meaning load immediate li $t0, 8 register $t0 is set to the value, 8. store word sw $t2, 0($t1) the value in register $t1 is used as the memory address. the value in register $t2 is copied into this memory address. add addiu $t4, $t3, 29 register $t4 is assigned the sum of 29 and the value in register $t3. jump j your_label_name the program jumps to the line following the label, "your_label_name: ". label your label name: defines a label called "your_label_name: " that can be jumped to