2. Consider the following three periodic real-time tasks to be scheduled on a uniprocessor: Task T1 T2 T3 Period 10 20 5 Execution time 4 4 1 (a) Determine whether the task set is schedulable using Earliest Deadline First (EDF). Draw the schedule up to 20 time units or until there is a dedline miss whichever is earlier. Explain your work. Assume all tasks are released together at time zero. (b) Determine whether the task set is schedulable using Rate Monotonic Scheduling (RMS). Draw the schedule up to 20 time units or until there is a deadline miss whichever is earlier. Explain your work. Assume all tasks are released together at time zero