Q4. Consider the following 5 processes and their arrival and CPU times. CPU time (CPU burst length) Arrival time 0 15 A B 50 80 1 D E 35 55 65 40 20 50 Assume that in case of a tie, a process with lower ID enters the ready-queue first. A has lower ID than B, for example. For each of the following scheduling algorithms, find out the finish time and total waiting time in the ready queue for each process. a) RR scheduling with q = 30 ms. b) RR scheduling with q = 10 ms. c) RR scheduling with q = very very small (much smaller than 1, i.e., close to 0; perfect sharing). d) SRJF. e) FCFS