There are four tasks that are instantiated only once, with the following times: start $($S$),$ run

$($C$)$ and limit time $($D$)$:

$A$:$S=0,C=4,D=15$

B: $S=0,C=3,D=12$

$C$:$S=2,C=5,D=9$

$D$:$S=5,C=2,D=8$

For this set of tasks:

$($a$)$ show whether an EDF planning is feasible, and represent it in a Grantt diagram

or timeline.

b$)$ show whether a monotonic rate schedule is feasible.

c$)$ if so$,$ compare the Grantt diagrams or timelines of the two

d$)$ use this case to make a comparison with scheduling used in non$-$real$-$time

operating systems such as FIFO or FCFA $($first in first served$)$ scheduling.