Simulate using java link lists the arrival and servicing of a single queue for rho of 0.7,0.8 and 0.9 for 100,000 customers. Output the avg waiting time, the avg queue length and the avg busy period for the server every 10,000 customers. Use exponential inter-arrivals and service times. Inter-arrivals occur on avg every 10 seconds (1/lambda), For example for rho=.7, the avg service times are on avg 10*.7=7 seconds =1/mu (it takes 7 sec to complete a job); thus lambda=0.1 and mu=0.1428 sec. checks on your output:the steady state number of customers in the queue not including the one in service is given by mu/(1-mu)-1. busy period is 1/(mu-lambda). 1/lambda 0.1 rho avg q mu busy waiting 0.7 1.33 0.1428 23.3 22.3 0.8 3 0.125 40 39 0.9 8 0.11 90 89