(b) Compute the waiting time of each task in each schedule, and the average waiting time for each schedule.
(c) The turnaround time of a task is the duration between its arrival time and the time the task completes its execution. Compute the turnaround time of each task in each schedule, and the average turnaround time for each schedule.
(d) Suppose new, short, high-priority tasks are continuously being added to the ready queue. In which of the scheduling algorithms considered above might some tasks suffer from starvation (where a task is unable to make progress towards completion)?
2. The following table gives arrival and computation times for a set of tasks in a real time system .Task Arrival time*Computation time Priority ( for priority – based schedule only!I]I’s( a ) Draw a chart like the one ain the the lecture slides . Show the arrival time and computation.time of each task , and show four schedules for the set of tasks . first come first served, round robinwith a quantum size of &, priority ( with a larger priority munber indicating a higher priority ;, and[ preEmptive ) shortest job first . ( In preemptive SIF, if a task arrives with a shorter computationtime than the remaining time of the currently running task , It preempts the current task .!