Given processes and corresponding CPU burst times as in the table below, determine the order of execution for SJF scheduling. Process CPU Burst Time A 5 B 12 7 D 8 E 2. O a. ABCDE O b. ECADB O c EDCBA O d. EACDB O e. None of these ston 32 yet vered Assume you have the following jobs to execute with one processor Note: 1: highest; 5: lowest Sed out of Process Priority lag question A B D E Arrival Time 0 0 15 30 40 CPU Burst time 35 25 15 15 15 4 2 3 2 1 Using a preemptive priority scheduling with no cost context switching, what is the turnaround time for process A O a. 105 O b. 70 O c. 55 O d. 120 For a fixed number of processes, SJF scheduling algorithm: O a. Minimize average turn-around time. O b. Maximizes CPU throughput O c. Minimize average waiting time. O d. Only Maximizes CPU throughput and Minimize average response time. O e. Only Minimize average waiting time and Minimize average turn-around time 5.1 Multilevel scheduling