(6+2+2 points) The following processes are being scheduled using a preemptive, priority-based, round- robin scheduling algorithm. Processes Arrival time Service time Priority P₁ 0 3 8 P2 0 4 3 P3 4 4 4 P4 8 4 4 P5 P6 5 5 5 5 15 18 Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highest priority process. For processes with the same priority, a round- robin scheduler will be used with a time quantum of 3 time units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. (a) Show the scheduling order of the processes using a Gantt chart. (b) What is the turnaround time for each process? (c) What is the waiting time for each process?

A user complains that her computer is performing slowly. She tells you the problem started about a week ago when new database software was installed. The software runs in the background to update a database synced between the user’s workstation and database server. Which is the best tool or method to use to determine if the new software is hogging computer resources? a. Uninstall the database software and see if performance improves. b. Use Performance Monitor and Process counters to observe performance. c. Use the Performance tab of Task Manager to observe database software activity. d. Install more memory to improve system resources to handle the new software.