4) For this problem you will need to revise the scheduling analysis for the deterministic workload defined in the Lecture notes, to take into consideration process switching time. Assume that task switching time is 1 cycle. Fill out the table below for MLFQ scheduling with q=3. Process arrival service time required 0 start time finish time name W P A 4 1 2. B C 2. 2. 9 5 5 mean 4) For this problem you will need to revise the scheduling analysis for the deterministic workload defined in the Lecture notes, to take into consideration process switching time. Assume that task switching time is 1 cycle. Fill out the table below for MLFQ scheduling with q=3. Process arrival service time required 0 start time finish time name W P A 4 1 2. B C 2. 2. 9 5 5 mean