71. In non-preemptive shortest job first scheduling, consider the following five processeseach having its own unique burst time and arrival time. What is the average waitingtime？
【用戶】ametachu
【年級】高三下
【評論內容】The processes will get executed in the following steps:job P4 arrives at time t=0, and gets executedafter that at time=1, the process P3 comes. Since the burst time of P4 has a short burst time so it will get executed.all the jobs at each instance of time, a new job arrives and it is then compared to the burst time of other jobs. And the jobs having the shortest burst time will get executed.at time=15, when the process P1 gets executed, there is only job P3 left. So, it will get executed.at time=23, the process P3 will finish.