(7) Five equal size datagrams (numbers 1 to 5) belonging to the same message leave for the destination one after another. However, they travel through different paths as shown in the following table: Datagram # Path Length (km) Visited switches # 1.000 1.2.5 2.800 1.3.5 3.200 1,2,4,5 4,200 1.3.5 5,800 1.4.2.5 Assume that the delay for each switch 1 through S (including waiting and processing delay) is 4. 12. 22. 10, and 16 ms, respectively. If the propagation speed is 2 x 10'm's, calculate the following (1) the order the datagrams arrive at the destination and (2) the delay for each (in second) Ignore any other delays in transmission (8) Which of the following switch does not need setup and teardown? (A) circuit (B) datagram (C) virtual circuit (D) electric (E) none of the above (9) The data sent using the following switch would not necessarily arrive at the destination) at the same time? (A) circuit (B) datagram (C) virtual circuit. (D) clectric (E) none of the above (10) Using the switch number (A-1, A-2...C-4) in a Banyan switch (see picture below), write the flow of data sent from input 4 to output 6. E.8 A-4, B-4, C-4 if the data sent from input 7 to output Left bil Middle Right C