An operating system uses a preemptive scheduler algorithm for the volues . given table below; ID Submission Time Required computing Time 4 0 el cova 3 4 6 3 1 a) Assuming a scheduling quantum of 2 time units and the running process is preempted only if its quantum expires or it receives its required computing time and exits. What is the response time and turnaround time for each process b) Assuming that the scheduler is noo- preemptive and uses the shortest - Job- first (SJF) heuristic, whot is the response time and turn around time for each process