please show all work, i need to understand this, textbook not helping

Exercise 4. Let T-(Ti, T2, Ts, T4, Ts) be a single instance and non-preemptive task set on three processor platform given by: T,= (2, 2, 5), T2- (0, 1, 6, T-(0,7,8), Ts= (0, 8.9). a) show that Tis non-schedulable using EDF, LLF, and Algorithm C scheduling techniques d) find a feasible schedule using Algorithm D from the current lecture. Exercise 4. Let T-(Ti, T2, Ts, T4, Ts) be a single instance and non-preemptive task set on three processor platform given by: T,= (2, 2, 5), T2- (0, 1, 6, T-(0,7,8), Ts= (0, 8.9). a) show that Tis non-schedulable using EDF, LLF, and Algorithm C scheduling techniques d) find a feasible schedule using Algorithm D from the current lecture