2. (From Ross] Consider a single-server queueing model in which customers arrive according to a nonhomogeneous Poisson process. Upon arriving they either enter service if the server is free or else they join in the queue. Suppose, however, that each customer will only wait a random amount of time, having distribution F, in queue before leaving the system. Let G denote the service distribution . Dene variables and events so as to analyze this model, and give the updating procedures. Suppose we are interested in estimating the average number of customers by time T, where a customer that departs before entering service is considered lost. 3. (From Ross) Suppose in Problem 2 that the arrival process is a Poisson process with rate 5; F is the 1miform distribution on [0, 5); and G is an exponential random variable with rate 4. Do 500 simulation runs to estimate the expected number of lost customers by time 100. Assume that customers are served in their order of arrival