Question F $(20$ points$)-$ RMS$,$ EDF, DMS Scheduling:

Provide a periodic task set, having three tasks, that is schedulable by EDF, but

not by RMS$.$ Support your answer with necessary schedulability analysis or

schedule.

If the deadline is not equal to the task period $($e$.$g$.,$ relative deadline is less than the

period$),$ RMS is not an optimal static priority algorithm. Show this by means of

an example. That is$,$ construct a task set which is not RM$-$schedulable, but is

schedulable by some other algorithm that considers "relative deadline" for

priority assignment.

Hint: Choose a task set that is schedulable by Deadline Monotonic Scheduling

$($DMS$)$ algorithm, but not by RMS algorithm.