Consider the gbn protocol with a sender window size of 3 and asequence number range of 1024. suppose that a time t, the next inorder packet that the receiver is expecting has a sequencenumber of k. assume that the medium does not reorder messages. answer the foll. questions: a) what are the possible sets of sequence numbers inside thesender's window at time t? justify your answer. b) what are all the possible values of ack field in all possiblemessages currently propagating back to the sender at time t? justify your answer.

Problem 1 - hashing we would like to use initials to locate an individual. for instance, mel should locate the person mark e. lehr. note: this is all upper case. generate a hash function for the above using the numbers on your telephone. you know, each letter has a number associated with it, so examine your telephone keypad. generate 512 random 3 letter initials and take statistics on a linked list array size 512 to hold this information report how many have no elements, 1 element, 2 elements, does this agree with the hashing statistics distribution?

Which software would you use to create a print design? a. illustrator b. audacity c. reaper d. dreamweaver

What did creator markus “notch" persson initially call his game