Consider a packet of length 1,500 bytes that begins at end system A and travels over three links to a destination end system B. These three links are connected by two packet switches. The propagation speed on all three links is 2.5 × 108 m/s, the capacity of the three links is 10 Mbps, 5 Mbps and 20 Mbps, respectively, the packet switch processing delay is 1 msec, and the lengths of the three links are 5,000 km, 2,500 km, and 1,000 km, respectively. Suppose there is no queuing delay. What is the end-to-end delay? Describe the components in the end-to-end delay and show intermediate steps.

Write a program that begins by reading in a series of positive integers on a single line of input and then computes and prints the product of those integers. integers are accepted and multiplied until the user enters an integer less than 1. this final number is not part of the product. then, the program prints the product. if the first entered number is negative or 0, the program must print “bad input.” and terminate immediately. next, the program determines and prints the prime factorization of the product, listing the factors in increasing order. if a prime number is not a factor of the product, then it