12 passengers per minute arrive at the concorse of a busy airport according to a Poisson process. After arrival, passengers travel down various routes according to the probabilities on the diagram below. Assume processing times at each stage are from the exponential distribution. Assume all travel times between nodes are zerdo 3. 3/4 KioskCheckln 2/3 DelailedTSAScreen ArriveAtAirport BaggageWeighln BagageSecurityIDCheck InitialTSAScreen Gate 1/3 3/4 AgentCheckln As you analyze this system, make sure that 100% of your entities make it through the system The number of servers at each node and the service times per server are given this table: No. ofMean service time Servers (min) per server Station Kiosk Check In Agent Check In Baggage Weigh In Baggage Security ID Check Initial TSA Screen Detailed TSA Screen 10 1/2 1/2 1/12 1/12 1/3 12 passengers per minute arrive at the concorse of a busy airport according to a Poisson process. After arrival, passengers travel down various routes according to the probabilities on the diagram below. Assume processing times at each stage are from the exponential distribution. Assume all travel times between nodes are zerdo 3. 3/4 KioskCheckln 2/3 DelailedTSAScreen ArriveAtAirport BaggageWeighln BagageSecurityIDCheck InitialTSAScreen Gate 1/3 3/4 AgentCheckln As you analyze this system, make sure that 100% of your entities make it through the system The number of servers at each node and the service times per server are given this table: No. ofMean service time Servers (min) per server Station Kiosk Check In Agent Check In Baggage Weigh In Baggage Security ID Check Initial TSA Screen Detailed TSA Screen 10 1/2 1/2 1/12 1/12 1/3