Consider rdt $2\mathrm{.}2$

Suppose that the channel connecting the sender and receiver can corrupt but not

lose or reorder packets. Now consider the figure below, which shows four data

packets and three corresponding ACKs being exchanged between an rdt $2\mathrm{.}2$ sender

and receiver. The actual corruption or successful transmission$/$reception of a packet

is indicated by the corrupt and OK labels, respectively, shown above the packets in

the figure below.

Match following questions with proper responses:

Hint: questions may have same matching response and not all responses will be

used!

How many times is the

payload of the received

pacicet passed up to the

higher layer?

At time $t=2,$ what is the

sequence$/$ack of the

packet?

At time $t=1,$ what is the

receiver state?

At time $t=1,$ what is the

sender state?

At time $t=3,$ what is the

sender state?

At time $t=0,$ what is the

sender state?

At time $t=2,$ what is the

sender state?

At time $t=0,$ what is the

sequence$/$ack # of the

packet?

At time $t=1,$ what is the

sequence$/$ack # of the

packet?

At time $t=3,$ what is the

sequence$/$ack$.$ # of the

packet?

At time $t=3,$ what is the

receiver state?

At time $t=0,$ what is the

receiver state?

At time $t=2,$ what is the

receiver state?