1. The following table gives computation times for a set of tasks in a real time system. All tasks arrive in the queue at approximately time t = 0.

(b) The waiting time of a task is the total amount of time it spends in the ready queue. What is the waiting time of each task in the first come first served schedule? What is the waiting time of each task in the round robin schedule? Compute the average waiting time for each schedule.

(c) In shortest job first (SJF) scheduling, tasks are scheduled in order of their computation time, with the shortest task scheduled first. SJF is known to give the minimum average waiting time for a set of processes. Draw the SJF schedule on a chart. What is the waiting time of each task? What is the average waiting time?

For all questions in this homework set, you may ignore the overhead of context switching.1. The following table gives computation times for a set of tasks in a real time system. All tasks arrive inthe queue at approximately time t = 0.Task Order in queue Computation timeTi10T219T333(a) Draw charts showing two schedules for this set of tasks: one with a first come first served order andone with a preemptive round robin order with a time slice (quantum) size of 2.