Consider the Pipeline version of reliable data transfer protocol, using Go$-$Back$-$N$.$ Assume that the window size equals three and there are six packets $($i$.$e$.,$ pkt$0,$ pkt$1,...,$pkt$5)$ to send out. Also, assume that pkt$2$ is lost; complete the transmission timeline below until all packets are sent and acknowledged. $($Mark the window positions$)$ and $($Annotate the receiver actions$)$