Consider a G/G/2 queuing system in which customers take service from Server 1 when both servers are available. Inter-arrival times: 0.2,0.05,0.15,0.1,0.02,0.3,0.01,0.5,0.3, 0.5,0.1,0.01,0.6,0.15 Service times of Server 1: 0.03,0.13,0.2,0.7,0.62,0.45,0.2, 0.8,0.15,0.45,0.05,0.3,0.8 Service times of Server 2: 0.1,0.4,0.25,0.7,0.4,0.5,0.18,0.01, 0.4,0.1,0.2,0.62,0.13 Using the inter-arrival and service times given above (in minutes) in the given order, create a record of hand simulation using the event-scheduling algorithm until time TE=3 minutes and compute the below stated performance measures. Assume that the first arrival occurs at time t=0. a. Average number of jobs in the system b. Average number of jobs in the queue c. Utilization of Server 1 d. Utilization of Server 2 e. Average time in the system f. Average waiting time in the queue g. Maximum number of jobs in the queue