Consider the gbn protocol with a sender window size of 4 and a sequence number range of 1024. suppose that at time t, the next in-order packet that the receiver is expecting has a sequence number of "k". assume that the medium does not reorder messages. answer the following questions:

1.what are the possible sets of sequence numbers inside the sender’s window at time t? justify your answer.

2. what are all possible values of the ack field in all possible messages currently propagating back to the sender at time t? justify your answer.

Write a program which asks you to enter a name in the form of first middle initial last. so you might enter for example samuel p. clemens. use getline to read in the string because it contains spaces. also, apparently the shift key on your keyboard doesn’t work, because you enter it all lower case. pass the string to a function which uses .find to locate the letters which need to be upper case and use toupper to convert those characters to uppercase. the revised string should then be returned to main in the form last, first mi where it will be displayed.

This os integrated the processing power of windows nt with the easy-to-use gui of windows 98. windows 2000 windows 3.11 windows for workgroups windowa millennium edition

My has been slow anyone else’s ?