Show work please.

A computer system uses a first arrival dispatch algorithm on the job queue, this means first come first served (like waiting in a supermarket line).If two jobs arrive at the same time, the job with the lowest number is served first Once started it cannot be interrupted. When a job completes, the next a job is job in line is selected. Job l arrives at time 0 and needs 500 milliseconds to complete. Job 2 arrives at time 300 milliseconds and needs 400 milliseconds to complete. Job 3 arrives at time 400 and needs 200 milliseconds to complete. Job 4 arrives at time 400 milliseconds and needs 500 milliseconds to complete. Fill the out timeline table and calculate the waiting times. Each box is 100ms in duration. Enter (W)ait or (R)unning. Calculate the average wait time. Calculate the average turn-around-time