Seven processes have arrival, service times, and priority as…

Seven processes have arrival, service times, and priority as shown below. Be sure to show your work. Process Arrival Time Service Time Priority Start Time Finish Time A 0 3 1 0 3 B 1 5 4 5 10 C 3 2 5 3 5 D 9 5 2 17 22 E 10 3 1 10 13 F 11 4 4 13 17 G 12 5 3 22 27   Higher numbers represent higher priority. The time sequence is: What scheduling algorithm was used? Explain. What is the Response Time for Process D? What is the Turnaround Time for Process E? What is the Wait Time for Process F? What is the Throughput. If process H arrived at time 15 with a service time of 2 and priority 5, when would it start under preemptive priority scheduling? Explain. If minimizing turnaround time were your goal, which scheduling algorithm is best? `

Two hundred memory units are available to the Operating Syst…

Two hundred memory units are available to the Operating System. Process A is using 50 units and can claim 60. Process B is using 10 units and can claim 30 units. Process C is using 40 units and can claim 60. Process D is using 80 units and can claim 100. Process A requests an additional 20 units. Can the Operating System grant the request? Why? Show all your work.  You may assume you are currently in a safe state.