A queue is observed over 10000 one-second time intervals with data as given below in the array 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 P(n4), where n is the queue size in this model? 4. Suppose that two equivalent servers are introduced. What would the equilibrium probability P(n4) then be? qdata=[5,5,5,6,5,6,6,7,6,5,6,5,4,5,6,6,6,7,8,7,6,6,6,5,4,4,5,5,4,5,6,6,5,4,3,3,len(qdata)