Problem 1 Consider a source and a destination connected by N links (i.e., N-1 packet switches). Each link has capacity R bps, and propagation delay d seconds. Ignore processing and queueing delays. a) b) c) Give a formula for the end-to-end delay of sending one packet of length L bits. Generalize the formula for sending P packets of L bits each. Now suppose the links (in the order from source to destination) have capacities R1 R2 > d) > RN (still arbitrary values for d1, d2, , dN)