Exercise 1: (1+1+2=4p) Two neighboring nodes A and B use a sliding-window protocol with a 3-bit sequence number. Window size is 4. Assuming A is transmitting and B is receiving, which frames are in A's window for the following succession of event: a) Before A sends any frames b) After A sends frames 0, 1, 2 and receives acknowledgment from B for 0 and 1 c) After A sends frames 3, 4, and 5 and B sends RR5 and ACK is received by A

Fig: 1