Extra problems (for Homework 1): 1. Construct a set of periodic tasks (showing start times, computation times, and periods, and different from the examples in the textbook) which can be scheduled by the EDF algorithm but not by the RMS algorithm. 2. Suppose a task has parameters (c,p,d) and there is 1 CPU. Let task 1 = (3,9,9). Let task 2 = (3,8,8). Let task 3 = (3,15,15). (a) Computer utilization. (b) Show whether an RM schedule exists or not. Show schedule if yes. (c) If no RM schedule exixts, show a EDF or LLF schedule.