This problem compares fixed vs. dynamic priorities, and is based on an example by Burns and Baruah (2008). Consider two periodic tasks, where task T1 has period p1 = 2, and task T2 has period p2-3. Assume that the execution times are e1 1 and 2 = 1.5. Suppose that the release time of execution of task T1 1s given by ri ,i = 0.5 + 2(i-1) for i = 1,2, -.. Suppose that the deadline of execution i of task T1 is given by . 1,1 2i. Correspondingly, assume that the release times and deadlines for task T2 are T2,i = 3(i-1) and (a) Give a feasible fixed-priority schedule. (b) Show that if the release times of all executions of task T are reduced by 0.5, then no fixed-priority schedule is feasible. (c) Give a feasible dynamic-priority schedule with the release times of task T1 reduced to ri ,i = 2(i-1) This problem compares fixed vs. dynamic priorities, and is based on an example by Burns and Baruah (2008). Consider two periodic tasks, where task T1 has period p1 = 2, and task T2 has period p2-3. Assume that the execution times are e1 1 and 2 = 1.5. Suppose that the release time of execution of task T1 1s given by ri ,i = 0.5 + 2(i-1) for i = 1,2, -.. Suppose that the deadline of execution i of task T1 is given by . 1,1 2i. Correspondingly, assume that the release times and deadlines for task T2 are T2,i = 3(i-1) and (a) Give a feasible fixed-priority schedule. (b) Show that if the release times of all executions of task T are reduced by 0.5, then no fixed-priority schedule is feasible. (c) Give a feasible dynamic-priority schedule with the release times of task T1 reduced to ri ,i = 2(i-1)