I just want the final solution as soon as possible. Thanks

If a scheduling algorithm always gives the printer to the process with the smallest print job, what can happen? Question 21 Not yet enswered Marked out of 7.00 Flag question O a. printer lockup O b. circular wait O c. starvation O d. mutual exclusion Thread pools are important due to which one of the following statements: estion 22 Et yet swered arked out of O a. Thread pools limit the number of threads which allows full system utilization Flag question Ob. Thread pools limit the number of threads makes the server start faster O c. Thread pools limit the number of threads and allow very fast connection to the clients O d. 'Thread pools limit the number of threads and so no clients have to wait estion 23 How many instructions can a processor execute at a time? yet wered O a. One rked out of - Flag question O b. Equal to the number of processes in the ready queue O c. Depends on the operating system O d. Two Oe. Equal to the number of concurrent processes in memory estion 24 In CPU-bound processes Et yet swered Erked out of 0 Flag question O a. The wait times may be too big O b. Synchronization cannot be performed correctly O c. More time spent in I/O than computation O d. A good process mix is achieved O e. More time spent in computation than 1/0 Question 25 Hot yet nswered Marked out of Kemel means: .00 Flag question a. Program running at all times on the computer. O b. The entire software shipped as OS by the manufacture. O c. Architecture dependent parts of the OS code. O d. The parts of the OS code concerned with security