A non-preemptive scheduling algorithm picks a process, and then O a. None of these O b. All of these O c. lets it run until it blocks O d. does not change scheduling decisions after interrupts lets it run until it voluntarily releases CPU In CPU-bound processes a. More time spent in computation than I/O O b. The wait times may be too big O c. More time spent in I/O than computation O d. Synchronization cannot be performed correctly O e. A good process mix is achieved