Jobs arrive at a single-CPU computer facility with interarrival times the are IID exponential random variables with mean 1 minute. Each job specifies upon arrival the maximum amount of processing time it requires, and the maximum times for successive jobs are IDD exponential random variable with mean 1.1 minutes. However, if m is the specified maximum processing time for a particular job, the actual processing time is distributed normally, having a mean of 0.80m and standard deviation of 0.323 m the CPU will never process a job for a more than its specified maximum; a job whose required processing time exceeds its specified maximum leaves the facility without completing service. Simulate the computer facility until 500 jobs have left the CPU

First Policy: if (a) jobs in the queue are processed in a FIFO (First in First Out) manner, and (b) jobs in the queue are ranked in increasing order of their specified maximum processing time. For each case, compute the average and maximum delay in the queue of jobs, the proportion of jobs that are delay in queues more than 5 minutes, and the maximum number of jobs ever in the queue.

Second Policy: if (a) jobs in the queue are processed in a LIFO (Last in First Out) manner, and (b) jobs in the queue are ranked in increasing order of their specified maximum processing time. For each case, compute the average and maximum delay in the queue of jobs, the proportion of jobs that are delay in queues more than 5 minutes, and the maximum number of jobs ever in the queue.

Run the simulation 15 times for each policy.

Create a 500 random U(0,1) for each 15 time you run the simulation and use this values to generate the exponential values, the Normal values. Remember to use the same random U(0,1) for both policies to generate Normal, and exponential values.

Compare graphically the Policies using Figure below, where X_1j is the average delay for FIFO, and X_2j is the