Simulate the operation of a single server queuing system until time T = 30 minutes, using the interarrival and service-times given below (in minutes) in the given order. Use FIFO (first in-first out) logic for the queue. Interarrival times: 6, 2, 3, 3, 1, 3, 5,9 Service times: 3, 1, 4, 4, 6, 6, 2, 4 Given that the first arrival occurs at time t = 0, create a record of hand simulation (on the table given in the following page) and compute the following performance measures (show how you calculate): 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. Maximum time in system for a customer i. Total number of jobs that arrived at the system j. Total number of jobs that started service k. Total number of jobs completed service. Tabbed Tinct. Simulate the operation of a single server queuing system until time T = 30 minutes, using the interarrival and service-times given below (in minutes) in the given order. Use FIFO (first in-first out) logic for the queue. Interarrival times: 6, 2, 3, 3, 1, 3, 5,9 Service times: 3, 1, 4, 4, 6, 6, 2, 4 Given that the first arrival occurs at time t = 0, create a record of hand simulation (on the table given in the following page) and compute the following performance measures (show how you calculate): 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. Maximum time in system for a customer i. Total number of jobs that arrived at the system j. Total number of jobs that started service k. Total number of jobs completed service. Tabbed Tinct