Q.5 (*) A queue is observed over 10000 one-second time intervals with data as given below in the array odata Construct a Poisson nearest neighbour model with a single arrival and servicing pattern and hence answer the following questions: 1. What is the average time taken for 1 customer to arrive? 2. What is the average number of customer servicings per second? 3. What is your estimate for the equilibrium probability Pln 24), where is the queue size in this model? 4. Suppose that two equivalent servers are introduced, what would the equilibrium probability PM24) then be? aidata - 15, 5, 5, 6,5 ..., 4.5, 5, 4, 6,5,4,3,2,3,1, 2012 leniodata Q.5 (*) A queue is observed over 10000 one-second time intervals with data as given below in the array odata Construct a Poisson nearest neighbour model with a single arrival and servicing pattern and hence answer the following questions: 1. What is the average time taken for 1 customer to arrive? 2. What is the average number of customer servicings per second? 3. What is your estimate for the equilibrium probability Pln 24), where is the queue size in this model? 4. Suppose that two equivalent servers are introduced, what would the equilibrium probability PM24) then be? aidata - 15, 5, 5, 6,5 ..., 4.5, 5, 4, 6,5,4,3,2,3,1, 2012 leniodata