Question 1 (100 points) Simulate the operation of a single resource first-in-first-out (M/M/1) queuing system until time TE=30 minutes, using the interarrival and service-times given below (in minutes) in the given order. Interarrivaltimes:Servicetimes:4,3,1,1,5,7,104,4,6,9,8,7,4,6 Given that the first arrival occurs at time t=0, create a record of hand simulation (on the table given in the last page) using the event-scheduling algorithm (50 points) and compute the following performance measures ( 5 points each): a. Time-average number of jobs in the system. b. Time-average number of jobs in the queue c. Average utilization of the server d. Average time in the system per customer e. Average waiting time in the queue per customer f. Maximum number of jobs in the queue g. Maximum waiting time in the queue for a customer h. Total number of jobs that arrived at the system i. Total number of jobs that started service j. Total number of jobs completed service. Ekran Resmi Question 1 (100 points) Simulate the operation of a single resource first-in-first-out (M/M/1) queuing system until time TE=30 minutes, using the interarrival and service-times given below (in minutes) in the given order. Interarrivaltimes:Servicetimes:4,3,1,1,5,7,104,4,6,9,8,7,4,6 Given that the first arrival occurs at time t=0, create a record of hand simulation (on the table given in the last page) using the event-scheduling algorithm (50 points) and compute the following performance measures ( 5 points each): a. Time-average number of jobs in the system. b. Time-average number of jobs in the queue c. Average utilization of the server d. Average time in the system per customer e. Average waiting time in the queue per customer f. Maximum number of jobs in the queue g. Maximum waiting time in the queue for a customer h. Total number of jobs that arrived at the system i. Total number of jobs that started service j. Total number of jobs completed service. Ekran Resmi