Scheduling
2) Consider a task model consisting of two periodic tasks J1 (period T1 = 5, deadline d? = 5, WCET c1 = 3) and J2 (period T2 = 3, deadline d2 = 3, WCET c2 = 1).
a) Please show all the possibilities of a non-preemptive scheduling. Are any of them feasible? If not, please show the counter-example in each case.
b) Is it feasible to schedule such tasks using Rate Monotonic Scheduling (RMS) with preemption allowed? If so, please show the schedule until the scheduling pattern repeats.