Consider the Pipeline version of reliable data transfer protocol, using Selective$-$Repeat. Assume that the window size equals three and there are six packets $($i$.$e$.,$ pkt$0,$ pkt$1,..,$pkt$6)$ to send out. Also, assume that the acknowledgement of pkt$1$ is lost; complete the transmission timeline below until all packets are sent and acknowledged. $($Mark the window positions$)$ and $($Annotate the receiver actions$)$ You may not need all the lines below!