Help verifying answers

16. Paging 1) is breaking up of a program into units of various sizes D's breaking up of a program into units of the same size 3) is breaking up of all programs into the same number of units regardless of the size of the program; 4) is both 1) and 3) 17. What s TRUE: 1) hard real-time tasks specified time moments; 2) soft real-time tasks never have deadlines; 3) hard real-time tasks are always periodic tasks 4) round-robin algorithm cannot be used for real-time scheduling: must be executed exactly at n real-time computing, the correctness of the computation depends on the time at ch the results were produced. 18. If a job requires 20 time units of CPU run time to complete, and the length of the quantum is 12 time units, there will be: (in other words- how many time times the job will be interrupted) 1) 2 switches 2) 0 switches; 1 switch; 4) none of the above; 19. Turnaround time is: between job submission and job completion; time between job starts and job finishes execution; 3) a delay between job submission and job starting time; 4) time required by OS to execute all currently available jobs. Use the following information on progrom execution times to answer the next 2 questions (ol jobs arrive at the same time) CPU Time 1 hour 1 second 1 second Job Number 20. If the jobs run to completion on a First Come First Serve basis, then the turnaround time for Job 2 will be 1) 1 seconcd 2) 2 seconds 3) 1 hour Ti hour, 1 second 5) none of the above 21. If Round Robin is used with a time quantum of 1 second, then the turnaround time for Job 2 will be: 1) 1 second seconds i hour 4) 1 hour, 1 second 5) none of the above