Partl: For each of the following cases, calculate the latency (from first bit sent to the last bit received). Assume the bandwidth of each link is 2 Gbps, and the size of each packet is 100 Kb. Assume the length of each link is 20 meters and propagation speed in medium is 2*10 meters per second. There is no queuing or processing delay a. If the source sends a message containing I packet and there is I router on the path b. If the source sends a message containing I packet and there are 6 routers on the patih. c. If the source sends a message containing 10 packets and there is l router on the path d. If the source sends a message containing 10 packets and there are 6 routers on the path. Part2: Now keep all assumptions from partl except processing delay. Assume each router begins retransmitting a packet after it has finished receiving the packet and processed it for 6 microseconds. Processing delay is zero at source. Solve the problem for each of the 4 above-mentioned cases with this assumption. Notes: 6 0 0 1. 2. Refer to lecture3, slides 9 and 15, end-to-end delay for a message containing several packets. When a node transmits a packet, it doesn't need to wait for the last packet to be propagated along the link. As soon as one packet is transmitted into the link, the node can start transmitting the next packet