2. Three periodic processes with the following characteristics are to be scheduled: T is the CPU Time and D is the period of the process. Case 1 T D Case 2 T D Case 3 TD p1 3 50 p1 15 50 p1 5 20 ] p2 70 1000 p2 5 10 p2 7 10 p3 5 40 p3 1 p3 4 100 For each case, determine if a feasible schedule is likely to be generated by: RM EDF Draw the Gantt chart for the first 25-time units. For each of the 3 cases, show the schedules produced by RM and by EDF