Task task 1 task 2 task 3 Execution Time Piod 0.6 ms 1.2 ms ms 2 ms 3 ms ms Table 1.1. Task data for three tasks Problem 2. For the task data given in Table 1.1 of problem 1 the tasks are to be scheduled using a preemptive kernel with a Rate Monotonic (RM) scheduler. (a) What priorities should be assigned to these 3 tasks? (b) What is the upper bound on processor utilization for these three tasks that guarentees no deadlines are missed? (c) For the three tasks and the rate-monotonic (RM) scheduler sketch the program context over one hyperperiod (d) For the RM scheduler what is the worst case latency for each of the three tasks? Are any deadlines missed? Task task 1 task 2 task 3 Execution Time Piod 0.6 ms 1.2 ms ms 2 ms 3 ms ms Table 1.1. Task data for three tasks Problem 2. For the task data given in Table 1.1 of problem 1 the tasks are to be scheduled using a preemptive kernel with a Rate Monotonic (RM) scheduler. (a) What priorities should be assigned to these 3 tasks? (b) What is the upper bound on processor utilization for these three tasks that guarentees no deadlines are missed? (c) For the three tasks and the rate-monotonic (RM) scheduler sketch the program context over one hyperperiod (d) For the RM scheduler what is the worst case latency for each of the three tasks? Are any deadlines missed