Consider the MIPS code below. Match each line of MIPS with the correct comment that describes it. Assume that $a0 is used for the input and initially contains n, a positive integer. Assume that $v0 is used for returning the output value. begin: addi $t0, $zero, O [Choose] addi $t1, $zero, 1 [Choose] loop: slt $t2, $a0,$t1 [Choose] bne $t2. $zero, finish [Choose] add $t0,$t0,$t1 [Choose ] addi $t1,$t1,2 [Choose jloop [Choose) finish: add $v0, $to, $zero [Choose] Please refer to the MIPS code in the question above. What does the code compute? a. The sum of integers from 0 to n b. The sum of odd integers from 0 to n c. The sum of even integers from 0 to n d. The ceiling of n/2

Consider a slotted aloha system, where the time slot equals the fixed duration of each packet. assume that there are 4 stations a,b,c,d sharing the medium. (a) stations a,b,c,d receive one packet each from higher layers at times 1.3, 1.5, 2.6,5.7 respectively. show which transmissions take place when, according to the slottedaloha protocol; describe all transmissions until all four packets have been successful.when needed, each station has access to the following sequence of random number, provided by a random number generator and drawn uniformly between 0 and 1: (1) station a draws numbers: 0.31, 0.27, 0.78, 0.9, 0.9, 0.11, 0. (2) station b draws numbers: 0.45, 0.28, 0.11, 0.83, 0.37, 0.22, 0. (3)station c draws numbers: 0.1, 0.2, 0.3, 0.4, 0. (4) station d draws numbers: 0.36, 0.77, 0.9, 0.1, 0.1, 0.1, 0.1, 0. (b) in slotted aloha, a station transmits in each time slot with a given probability. what probabilities would you assign to each of the four stations so as to: (i) maximize the efficiency of the protocol? (ii) maximize fairness among the four stations? (c) will the efficiency increase or decrease if we modify slotted aloha as follows: (i) get rid of slots and allow stations to transmit immediately? (ii) implement carrier sensing? (iii) implement collision detection? (iv) implement collision avoidance?