Example 3. Consider the following set of processes in table below and the following scheduling algorithm - (a) SJF (b) Shortest Remaining Job First Process id Arrival Time Execution Time 12 If there is a tie within the processes, the tie is broken in favour of the oldest process. ) Draw Gantt Chart and find AWT & TAT for the two algorithms. Comment on your results, which one is better and why? un If the scheduler takes 0.2 units of CPU time in contest switching for the completes job and 0.1 unit of additional CPU time for incomplete jobs for saving their context Calculate the percentage of CPU time wasted in each case. IUPTU, B.Tech (CSE IT) -6 sem, 2005-0