(Solved): could you please help me with this question? thanks 2) (40 points) Consider a datagram packet switch ...

2) (40 points) Consider a datagram packet switched network shown below for the communication of two end points $A$ and $B$. As can be seen from the figure below, there are two alternative paths between $A$ and $B$. Each of these paths passes through one of the intermediate routers $(x$ or $y)$. The packet size used in this network is 50000 bits. Moreover, each packet has 2800 bits of header. Suppose you want to send a file of size $1\mathrm{Mbits}(1000000\mathrm{bits})$ from $A$ to $B$. The capacities of the links are given on the figure. Assume no propagation, processing and queuing delays. Which of the alternative paths gives the smallest end-to-end delay for the abovementioned transfer? Show your work by calculating end-to-end delay for both alternative paths.