2. Part of the introductory slides discusses the issue of breaking up (or not breaking up) a long message before transmission in a store-and-forward network. In this problem, we consider an instance of the problem where a file of length L bits is segmented into segments of M bits each. The sender attaches a header of length H bits to each segment to create a packet suitable for transmission. Assume that the file is transmitted (after segmentation) over a path of k links (through k 1 routers), and each link speed is R bits/sec. The network is uncongested, and propagation delays are ignored. (a) Give an expression for the end-to-end delay of the store-and-forward network. (b) Give an expression for the segment size M that minimizes the end-to-end delay of sending the entire file. Show your work. (c) Assume that L = 20 Mbits, H = 100 bits, R = 200 Kbps, and k = 5 links. Find i. T, the minimum end-to-end delay of sending the file over the k links when segmentation is used, and ii. T2, the end-to-end delay of sending the file over the k links when segmen- tation is not used