Exercise 2. Let us consider the following preemptive task sets T-J J63: J2, J3 and T2-J4, J5, J1:S1-0, cl-2, p1-di-10 3: S3-0, c3-9, p3-d3-25 and 14: S4 = 0, c4 = 2, p4-d4-10 16: S6-0, C6-4, p6 = d6-15 a) compute the utilization rates for T1 and T2 b) show that T1 is feasible using the rate-monotonic algorithm. c) show that T2 is feasible by the rate-monotonic algorithm. d) comment feasibility of T and T2 for the following two changes: p3-d3-20 and p5 d5 10