1. A group of students are studying for (pick up a piece of pizza, study w the pizza is gone, the st Broup of students are studying for an OS exam. The students can study only eating pizza. Each student executes the following loop: while (rue) a piece of pizza, study while eating the pizza. If a student finds that als gone, the student goes to sleep until another pizza arrives. The first o discover that the group is out of pizza phones PizzaShop to order another pizza before going to sleep. Each pizza has S slices. le code to synchronize the student threads and the pizza delivery thread. our solution should avoid deadlock and phone PizzaShop (i.e., wake up the hivery thread) exactly once each time a pizza is exhausted. No piece of pizza may be consumed by more than one student. [10points There is a simple paging system. The memory size is 64K, and the page size is R. For a four-page job. 80.81.82 and 83 pages are mapped into 82,714,86, and "page frames, respectively. Try to get physical addresses for logical addresses 1023, 1039 and 2500. [10points] 3. Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use nonpreemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process Pi Arrival Time Burst Time 0.0 0.4 1.0 P2 a. What is the average turnaround time for these processes with the FCFS scheduling algorithm? b. What is the average turnaround time for these processes with the SJF scheduling algorithm