operating system

Question 1 - First-Come, First-Served Using the first-come, first-served algorithm and that the jobs in the table are all received immediately, compute the waiting time and completion time for each job. Create a similar table to the one below in your lab report document. Below the table write the average wait time for all the jobs Question 2 - Shortest Job First Using the shortest job first algorithm and that the jobs in the table are all received immediately, compute the waiting time and completion time for each job. Create a similar table to the one below in your lab report document. Below the table write the average wait time for all the jobs. Question 3 - Round Robin Scheduling Using round-robin scheduling (process in the order P1,P2, etc) and a quantum time of 5ms, compute the waiting time and completion time for each job. Create a similar table to the one below in your lab report document. Below the table write the average wait time for all the jobs. Question 4 - Priority Base Round-Robin Scheduling Assume that your system is configured to use priority based scheduling ( 1 is highest priority, 2 is middle priority and 3 is the lowest priority) where jobs at the same priority level are scheduled using round-robin with a quantum time of 3 ms, compute the total waiting time and completion time for each job and calculate the average waiting time