Two periodic processes are ready to run at time 0: P1(8,4) and P2(5,2.5) (8 and 5 are intervals (periods), 4 and 2.5 are processing time). Draw a timeline for each process to show when they are running and when they are waiting, assuming that there is no context-switching overhead.
(a) The system uses EDF (earliest deadline first) scheduling.
(b) The system uses RM (rate monotonic) scheduling.