1-6 please

If a process in the Running state continues to execute until it terminates or blocks itse, we call this process management method: 1) Preemptive; 2) Nonpreemptive; 3) Interactive; 4) Non-scheduled; 5) Real-time. 2. Real physical address appears in the program: 1) After a programmer finishes writing a program; 2) After a program is saved to the disc; 3) During the execution time;- 4) During the booting time; 5) After a programmer inputs real data. 3. The Page-Map Table allows: 1) To replace the page number by frame number in the address; 2) To keep all pages in one table; 3) To find any instruction in a program; 4) To help a programmer to find the necessary data in the program; 5) To compile a program without errors. 4. What is the disadvantage of FIFO page replacement algorithm 1) It is very complicated; 2) It uses too much memory; 3) It has FIFO Anomaly; 4) It may cause starvation; 5) It makes the program execution time much longer. - 5. Process scheduling algorithms affect 1) CPU time required for execution; 2) Waiting time in READY queue; ~ 3) Input/Output operations time; 4) Memory management time; 5) Context switch time. 6. To prevent a deadlock, we need: 1) To use only non-preemptive process scheduling; 2) To use only preemptive process scheduling; 3) To avoid thrashing in memory management; 4) To break the sufficient condition of a deadlock 5) To break any necessary condition of a deadlock; - 7. The disadvantage of the Banker's algorithm is