Question 2. Preemptive Task Scheduling There are three periodic tasks in the system. Each task tt is characterized by (Ci, Ti), where C is the worst-case execution time and C, is the period. The relative deadline of each task is the same as its period. : (14,30), T2 : (17,60), T3 : (5,20) a) Determine whether the above task set is schedulable under Earliest Deadline First (EDF) scheduling policy. Determine whether the above taskset is schedulable under Rate Monotonic (RM) scheduling policy b) c) Is the taskset harmonic? d) Draw the timeline of the three tasks for one hyperperiod under RM scheduling. Assume that all tasks initially arrive together at time 0. 0 5 10 15 20 25 30 35 40 4550 55 60 Draw the timeline of the three tasks for one hyperperiod under EDF scheduling. Assume that all tasks initially arrive together at time 0. For tie-breaking, prioritize tasks with earlier release time. e) 0 5 10 15 20 25 30 35 40 45 50 55 60