$2.$ We want to transfer a File of size d bytes.Each link has bandwidth b bits$/$sec and fixed propagation delay f sec$.$ All routers on the path are store$-$and$-$forward. We use packets of total size P bytes, of which h bytes are occupied by headers. We always pad the last packet so that it is full. There is no set$-$up time for the transfer. Packets are sent continuously and are not lost. There is no queuing delay or processing overhead, and we ignore acknowledgments sent back by the receiver.a$.$ How many data packets are sent?b$.$ What is the delay $($from when the sender starts transmitting until when thereceiver has received everything$)$ to transfer the file across one link?c$.$ What is the delay for one packet to arrive at a destination that is n links away?d$.$ What is the delay in transferring the entire file across n links?