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

Exercise 3. Let T- (T, ....T be a single-instance and non-preemptive task set on a three- processor platform given by ,-(2, 2), T2-(7, 7), Ty, (8.9),1: (3, 6), T5-(1, 5), T6-6, I 2), and T-13, 1 1 ). a) show that T is non-schedulable using EDF and LLF techniques b) calculate USI (Utilization of Single-Instance) of T c) calculate TOR(T), the set of Task Order Restrictions d) find a feasible schedule using Algorithm A from the current lecture