An embedded application has three tasks with the task execution times and periods as shown in table 1.1. Task task 1 task 2 task 3 Execution Time 0.6 ms 1.2 ms 0.4 ms Period 2 ms 3 ms 4 ms Table 1.1. Task data for three tasks. This problem and the following two problems examine different scheduling schemes. (a) What is the processor load for these 3 tasks? (b) For a cooperative time-slice scheduler what are the maximum and minimum bounds on the length of the time-slice? (c) For the three tasks you will need to partition one of the tasks into subtasks and use mutual exclusion to get a feasible schedule. After doing this sketch the program context over one hyperperiod. (d) For this cooperative time-slice scheduler what is the worst case latency for each of the three tasks?