Station A wants to send some data consisting of $12$ packets to station B using a

sliding window $($window size $3)$ and go$-$back$-$n error control strategy. All packets are ready and

immediately available for transmission. If every $6$

th packet that A transmits is lost, then how

many transmissions are required for sending the message to B$?$