5. a) [5] Briefly explain the datagram switching process with the help of a diagram. Also explain the efficiency of datagram switched networks, b) [10] A B Suppose a message travels from A to B. What should be the total delay if you follow the 2nd longest possible path based upon the above diagram? Consider the networks as a datagram network. You cannot visit any component more than once [Component = any end device or internetworking device] Consider a 3.5 Mbyte message and bandwidth of the network is 10 Gbps. Assume that the distance between A and B is 11500 km and light travels at 2.4x108 m/s. Page 6 of 6 Consider the first waiting time as 3.03 seconds. The 2nd waiting time should be first waiting time * multiplied by 2 The 3rd waiting time should be first waiting time * multiplied by 3 The 4th waiting time should be first waiting time * multiplied by 4 The 5th waiting time should be first waiting time * multiplied by 5 The 6th waiting time should be first waiting time * multiplied by 6 The 7th waiting time should be first waiting time * multiplied by 7 You should only consider the waiting times that are needed based upon the above diagram